Skip to main content

A Cantor Trio: Denumerability, the Reals, and the Real Algebraic Numbers

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7406))

Abstract

We present a formalization in ACL2(r) of three proofs originally done by Cantor. The first two are different proofs of the non-denumerability of the reals. The first, which was described by Cantor in 1874, relies on the completeness of the real numbers, in the form that any infinite chain of closed, bounded intervals has a non-empty intersection. The second proof uses Cantor’s celebrated diagonalization argument, which did not appear until 1891. The third proof is of the existence of real transcendental (i.e., non-algebraic) numbers. It also appeared in Cantor’s 1874 paper, as a corollary to the non-denumerability of the reals. What Cantor ingeniously showed is that the algebraic numbers are denumerable, so every open interval must contain at least one transcendental number.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cantor, G.: On a property of the set of real algebraic numbers. In: From Kant to Hilbert, vol. 2, pp. 839–843. Oxford University Press (1874)

    Google Scholar 

  2. Ewald, W. (ed.): From Kant to Hilbert, vol. 2. Oxford University Press (2005)

    Google Scholar 

  3. Dunham, W.: The Calculus Gallery. Princeton (2005)

    Google Scholar 

  4. Cantor, G.: On an elementary question in the theory of manifolds. In: From Kant to Hilbert, vol. 2, pp. 920–922. Oxford University Press (1891)

    Google Scholar 

  5. Kaufmann, M., Moore, J.S.: An industrial strength theorem prover for a logic based on Common Lisp. IEEE Transactions on Software Engineering 23(4), 203–213 (1997)

    Article  Google Scholar 

  6. Manolios, P., Moore, J.S.: Partial functions in ACL2. Journal of Automated Reasoning (JAR) 31, 107–127 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Nelson, E.: Internal set theory: A new approach to nonstandard analysis. Bulletin of the American Mathematical Society 83, 1165–1198 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gamboa, R., Kaufmann, M.: Nonstandard analysis in ACL2. Journal of Automated Reasoning 27(4), 323–351 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wiedijk, F.: Formalizing 100 theorems (2012), http://www.cs.ru.nl/~freek/100/index.html

  10. Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, Orlando (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gamboa, R., Cowles, J. (2012). A Cantor Trio: Denumerability, the Reals, and the Real Algebraic Numbers. In: Beringer, L., Felty, A. (eds) Interactive Theorem Proving. ITP 2012. Lecture Notes in Computer Science, vol 7406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32347-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32347-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32346-1

  • Online ISBN: 978-3-642-32347-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics