211 search results - page 14 / 43 » On the Proof Theory of the Existence Predicate |
ITP
2010
14 years 18 days ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...
FASE
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
APAL
2006
13 years 8 months ago
2006
We prove a number of consistency results complementary to the ZFC results from our paper [4]. We produce examples of non-tightly stationary mutually stationary sequences, sequences...
TPHOL
2007
IEEE
14 years 3 months ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
CADE
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...