Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Information and Computation - Semantics of Data Types
IMPS: an interactive mathematical proof system
Journal of Automated Reasoning
Foundations of real and abstract analysis
Foundations of real and abstract analysis
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
An Equational Re-engineering of Set Theories
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Analytica - A Theorem Prover in Mathematica
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Putting theories together to make specifications
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Theory-specific automated reasoning
A 25-year perspective on logic programming
Reasoning, Action and Interaction in AI Theories and Systems
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
Journal of Automated Reasoning
| Hi-index | 0.00 |
We propose classical set theory as the core of an automated proof-verifier and outline a version of it, designed to assist in proof development, which is indefinitely expansible with function symbols generated by Skolemization and embodies a modularization mechanism named 'theory'. Through several examples, centered on the finite summation operation, we illustrate the potential utility in large-scale proof-development of the 'theory' mechanism: utility which stems in part from the power of the underlying set theory and in part from Skolemization.