438 search results - page 42 / 88 » On theorem proving in annotated logics |
ENTCS
2002
14 years 9 months ago
2002
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
SLOGICA
2010
14 years 8 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
106
click to vote
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
120
click to vote
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...