Skip to main content
Springer Nature Link
Log in

The GOEDEL Program

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The GOEDEL program is an ever-growing collection of currently more than thirty thousand rewrite rules for transforming expressions in Gödel’s class theory in the hope of thereby simplifying them. A brief survey of the program and its use is presented. A few striking results obtained recently using the program are featured to provide some of the flavor of the author’s on-going research over the past fifteen years.

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

Access this article

Log in via an institution

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

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Belinfante, J.G.F.: Computer proofs in Gödel’s class theory with equational definitions for composite and cross. J. Autom. Reason. 22, 311–339 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belinfante, J.G.F.: On computer-assisted proofs in ordinal number theory. J. Autom. Reason. 22, 341–378 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bernays, P.: A system of axiomatic set theory. J. Symb. Logic 2, 65–67 (1937)

    Article  MATH  Google Scholar 

  4. Gödel, K.: The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory. Princeton University Press, Princeton (1940)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Mycielski, J.: A system of axioms of set theory for the rationalists. Not Am. Math. Soc. 53(2), 206–213 (2006)

    MathSciNet  MATH  Google Scholar 

  7. Quaife, A.: Automated development of fundamental mathematical theories. Ph.D. thesis, Univ. of California at Berkeley. Kluwer Academic, Dordrecht (1992)

  8. Quine, W.V.: Set Theory and its Logic, revised edn. The Belknap Press of Harvard University, Cambridge (1963). Footnote on p. 157

    Google Scholar 

  9. Sion, M., Willmott, R.: On a definition of ordinal numbers. Am. Math. Mon. 69, 381–386 (1962)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Georgia Institute of Technology, Atlanta, GA, 30332-0160, USA

    Johan G. F. Belinfante

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

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Johan G. F. Belinfante.

Additional information

This paper is based on a talk presented 8 January 2011 in New Orleans at the Meeting #1067 of the American Mathematical Society, Special Session SS 12 on Formal Mathematics for Mathematicians, organized by Krystyna Kuperberg, Andrzej Trybulec, Artur Kornilowicz and Adam Naumowicz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Belinfante, J.G.F. The GOEDEL Program. J Autom Reasoning 50, 135–146 (2013). https://doi.org/10.1007/s10817-012-9259-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-012-9259-0

Keywords