Skip to main content

Formalizing Set Theory as it Is Actually Used

  • Conference paper
Mathematical Knowledge Management (MKM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3119))

Included in the following conference series:

Abstract

We present a formalization of the axiomatic set theory ZF which reflects real mathematical practice, and is easy for mechanical manipulation and interactive theorem proving. Unlike the standard first-order formalizations, our version provides a rich class of abstraction terms denoting sets on the one hand, and is based on purely syntactical (rather than semantic) considerations on the other hand.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Avron, A.: Transitive Closure and the Mechanization of Mathematics. In: Kamareddine, F. (ed.) Thirty Five Years of Automating Mathematics, pp. 149–171. Kluwer Academic Publishers, Dordrecht (2003)

    Chapter  Google Scholar 

  3. Avron, A.: Safety Signatures for First-order Languages and Their Applications. In: Hendricks, et al. (eds.) First-Order Logic revisited. Logos Verlag, Berlin (2004)

    Google Scholar 

  4. Fraenkel, A., Bar-Hillel, Y., Levy, A.: Foundations of Set Theory. North-Holland, Amsterdam (1973)

    MATH  Google Scholar 

  5. Hallett, M.: Cantorian Set Theory and Limitation of Size. Clarendon Press, Oxford (1984)

    MATH  Google Scholar 

  6. Padlewska, B.: Families of Sets. Formalized Mathematics 1, 147–152 (1990)

    Google Scholar 

  7. Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)

    MATH  Google Scholar 

  8. Shoenfield, J.R.: Axioms of Set Theory. In: Barwise, J. (ed.) Handbook Of Mathematical Logic. North-Holland, Amsterdam (1977)

    Google Scholar 

  9. Ullman, J.D.: Principles of database and knowledge-base systems. Computer Science Press, Rockville (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avron, A. (2004). Formalizing Set Theory as it Is Actually Used. In: Asperti, A., Bancerek, G., Trybulec, A. (eds) Mathematical Knowledge Management. MKM 2004. Lecture Notes in Computer Science, vol 3119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27818-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27818-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23029-8

  • Online ISBN: 978-3-540-27818-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics