The liar; an essay in truth and circularity
The liar; an essay in truth and circularity
Set theory in first-order logic: clauses for Go¨del's axioms
Journal of Automated Reasoning
Automated deduction in von Neumann-Bernays-Go¨del set theory
Journal of Automated Reasoning
Computer Proofs in Gödel’s Class Theory with Equational Definitions for Composite and Cross
Journal of Automated Reasoning
On Computer-Assisted Proofs in Ordinal Number Theory
Journal of Automated Reasoning
On Equivalents of Well-Foundedness
Journal of Automated Reasoning
Gödel's Algorithm for Class Formation
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Automated development of fundamental mathematical theories
Automated development of fundamental mathematical theories
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
Journal of Automated Reasoning
Hi-index | 0.00 |
The work described here is a part of ongoing efforts to construct a set-theoretic framework that is convenient for automated reasoning in mathematics within first order logic. The specific topic in focus here is the theory of invariant and subvariant sets, which permits the development of a unified theory of regular and finite sets. Appendices are included listing theorems involving the axiom of regularity, the classes REGULAR and FINITE of regular sets and finite sets, respectively, as well as general theorems about invariant and subvariant subsets, all proved using McCune's automated reasoning program Otter.