21 search results - page 1 / 5 » Click'n Prove: Interactive Proofs within Set Theory |
TPHOL
2003
IEEE
13 years 10 months ago
2003
IEEE
APAL
2008
13 years 5 months ago
2008
Abstract. We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of s...
JSC
2006
13 years 5 months ago
2006
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
CADE
2007
Springer
13 years 11 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
TPHOL
1999
IEEE
13 years 9 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...