Skip to main content
SpringerLink
Log in

Computer Proofs in Gödel’s Class Theory with Equational Definitions for Composite and Cross

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

Abstract

Some basic theorems about composition and other key constructs of set theory were proved using McCune’s computer program OTTER, building on Quaife’s modification of Gödel’s class theory. Our proofs use equational definitions in terms of Gödel’s flip and rotate functors. A new way to prove the composition of homomorphisms theorem is also presented.

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. Boyer, R., Lusk, E., McCune, W., OverÒeek, 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 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. Tarski, A. and Givant, S.: A Formalization of Set Theory without VariaÒles, Amer.Math. Soc., Colloquium PuÒlications, Vol. 41, Providence, 1987. Reviewed Òy Lisl Gaal in The Amer.Math. Monthly, March 1990.

  7. Wolfram, S.: Mathematica TM , A System for Doing Mathematics Òy Computer, 2nd edn, Addison–Wesley, New York, 1991.

    Google Scholar 

  8. Wos, L.: Automated Reasoning: 33 Basic Research ProÒlems, 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. Computer Proofs in Gödel’s Class Theory with Equational Definitions for Composite and Cross. Journal of Automated Reasoning 22, 311–339 (1999). https://doi.org/10.1023/A:1006050629424

Download citation

  • Issue Date:

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

Search

Navigation