Abstract
We describe a framework for formalizing mathematics which is based on the usual set theoretical foundations of mathematics. Its most important feature is that it reflects real mathematical practice in making an extensive use of statically defined abstract set terms, in the same way they are used in ordinary mathematical discourse. We also show how large portions of scientifically applicable mathematics can be developed in this framework in a straightforward way, using just rather weak set theories which are predicatively acceptable. The key property of those theories is that every object which is used in it is defined by some closed term of the theory. This allows for a very concrete, computationally-oriented interpretation. However, the development is not committed to such interpretation, and can easily be extended for handling stronger set theories, including ZFC itself.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the classical case this condition is derivable from the others.
- 2.
The use of binary predicates etc. can be reduced, of course, to the use of unary ones.
References
Avron, A.: Transitive closure and the mechanization of mathematics. In: Kamareddine, F.D. (ed.) Thirty Five Years of Automating Mathematics. Applied Logic Series, pp. 149–171. Springer, Heidelberg (2003)
Avron, A.: Formalizing set theory as it is actually used. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 32–43. Springer, Heidelberg (2004)
Avron, A.: A framework for formalizing set theories based on the use of static set terms. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 87–106. Springer, Heidelberg (2008)
Avron, A.: A new approach to predicative set theory. In: Schindler, R. (ed.) Ways of Proof Theory. Onto Series in Mathematical Logic, pp. 31–63. onto Verlag (2010)
Avron, A., Cohen, L.: Formalizing scientifically applicable mathematics in a definitional framework. J. Formalized Reasoning 9(1), 53–70 (2016)
Avron, A., Cohen, L.: A minimal framework for applicable mathematics (to appear, 2016)
Cantone, D., Omodeo, E., Policriti, A.: Set Theory for Computing: From Decision Procedures to Declarative Programming With Sets. Springer, New York (2001)
Devlin, K.: Constructibility. Perspectives in Mathematical Logic. Springer, Heidelberg (1984)
Feferman, S.: Weyl vindicated: Das kontinuum 70 years later. Termi e prospettive della logica e della filosofia della scienza contemporanee, vol. 1 (1988)
Fraenkel, A.A., Bar-Hillel, Y., Levy, A.: Foundations of Set Theory. Elsevier, Amsterdam (1973)
Gandy, R.O.: Set-theoretic functions for elementary syntax. In: Proceedings of the Symposium in Pure Mathematics, vol. 13, pp. 103–126 (1974)
Kieffer, S., Avigad, J., Friedman, H.: A language for mathematical language management. Stud. Logic Grammar Rhetoric 18, 51–66 (2009)
Levy, A.: Basic Set Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1979)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Avron, A. (2016). A Logical Framework for Developing and Mechanizing Set Theories. In: Olivetti, N., Tiwari, A. (eds) Automated Reasoning. IJCAR 2016. Lecture Notes in Computer Science(), vol 9706. Springer, Cham. https://doi.org/10.1007/978-3-319-40229-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-40229-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40228-4
Online ISBN: 978-3-319-40229-1
eBook Packages: Computer ScienceComputer Science (R0)