Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
A computational logic handbook
A computational logic handbook
Mathematica: a system for doing mathematics by computer (2nd ed.)
Mathematica: a system for doing mathematics by computer (2nd ed.)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Automated deduction in von Neumann-Bernays-Go¨del set theory
Journal of Automated Reasoning
IMPS: an interactive mathematical proof system
Journal of Automated Reasoning
Set theory for verification. I: from foundations to functions
Journal of Automated Reasoning
Contexts in mathematical reasoning and computation
Journal of Symbolic Computation - Special issue on design and implementation of symbolic computation systems
Should your specification language be typed
ACM Transactions on Programming Languages and Systems (TOPLAS)
Set Theory, Higher Order Logic or Both?
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Theory Interpretation in Simple Type Theory
HOA '93 Selected Papers from the First International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Proceedings of the 10th International Conference on Automated Deduction
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
IMPS: An Updated System Description
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Decidability results for sets with atoms
ACM Transactions on Computational Logic (TOCL)
A Rational Reconstruction of a System for Experimental Mathematics
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Combining type theory and untyped set theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Although set theory is the most popular foundation for mathematics, not many imechanized mathematics systems are based on set theory. Zermelo–Fraenkel (ZF) set theory and other traditional set theories are not an adequate foundation for mechanized mathematics. STMM is a version of von-Neumann–Bernays–Gödel (NBG) set theory that is intended to be a Set Theory for Mechanized Mathematics. STMM allows terms to denote proper classes and to be undefined, has a definite description operator, provides a sort system for classifying terms by value, and includes lambda-notation with term constructors for function application and function abstraction. This paper describes STMM and discusses why it is a good foundation for mechanized mathematics.