Skip to main content
SpringerLink
Log in

On Computer-Assisted Proofs in Ordinal Number Theory

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Some basic theorems about ordinal numbers were proved using McCune’s computer program OTTER, building on Quaife’s modification of Gödel’s class theory. Our theorems are based on Isbell’s elegant definition of ordinals. Neither the axiom of regularity nor the axiom of choice is used.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belinfante, J.: On a modification of Gödel's algorithm for class formation, Association for Automated Reasoning Newsletter 34 (1996), 10–15.

    Google Scholar 

  2. Belinfante, J.: On Quaife's development of class theory, Association for Automated Reasoning Newsletter 37(1997), 5–9.

    Google Scholar 

  3. Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., and Wos, L.: Set theory in first order logic: Clauses for Gödel's axioms, J. Automated Reasoning 2 (1986), 287–327.

    Google Scholar 

  4. Gödel, K.: The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis, Princeton University Press, Princeton, 1940.

    Google Scholar 

  5. Isbell, J. R.: A definition of ordinal numbers, Amer. Math. Monthly 67 (1960), 51–52.

    Google Scholar 

  6. McCune, W. W.: Otter 3.0 reference manual and guide, Argonne National Laboratory Report ANL–94/6, Argonne National Laboratory, Argonne, IL, January 1994.

    Google Scholar 

  7. Mendelson, E.: Introduction to Mathematical Logic, 3rd edn, Wadsworth and Brooks/Cole, Monterey, CA, 1987.

    Google Scholar 

  8. Quaife, A.: Automated deduction in von Neumann–Bernays–Gödel set theory, J. Automated Reasoning 8 (1992), 91–147.

    Google Scholar 

  9. Quaife, A.: Automated Development of Fundamental Mathematical Theories, Ph.D. Thesis, University of California at Berkeley, Kluwer Academic Publishers, Dordrecht, the Netherlands, 1992.

    Google Scholar 

  10. Rubin, J. E.: Set Theory for the Mathematician, Holden-Day, San Francisco, 1967.

    Google Scholar 

  11. Wolfram, S.: Mathematica TM, A System for Doing Mathematics by Computer, 2nd edn, Addison-Wesley, New York, 1991.

    Google Scholar 

  12. Wos, L.: Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, NJ, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Georgia Institute of Technology, USA

    Johan G. F. Belinfante

Authors
  1. Johan G. F. Belinfante
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Belinfante, J.G.F. On Computer-Assisted Proofs in Ordinal Number Theory. Journal of Automated Reasoning 22, 341–378 (1999). https://doi.org/10.1023/A:1006010913494

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006010913494

Search

Navigation