Gödel's algorithm for class formation

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 132-147

  Belinfante, Johan Gijsbertus Frederik ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; THEOREM PROVING;

AUTOMATED REASONING; COMPUTER IMPLEMENTATIONS; INPUT FILES; PREPROCESSING TOOLS; S-ALGORITHMS;

AUTOMATION;

EID: 84937415147     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_9     Document Type: Conference Paper

References (20)

1. [1996] Belinfante J. G. F. On a Modification of Gödel's Algorithm for Class Formation Association for Automated Reasoning News Letter No. 34 (1996) pp. 10-15
2. [1997] Belinfante J. G. F. On Quaife's Development of Class Theory Association for Automated Reasoning Newsletter No. 37 (1997) pp. 5-9
3. [1999a] Belinfante, J. G. F., Computer Proofs in Gödel's Class Theory with Equational Definitions for Composite and Cross, Journal of Automated Reasoning, vol. 22 (1999) pp. 311-339.
4. [1999b] Belinfante, J. G. F., On Computer-Assisted Proofs in Ordinal Number Theory, Journal of Automated Reasoning, vol. 22 (1999), pp. 341-378.
5. [1991] Bernays, P., Axiomatic Set Theory, North Holland Publishing Co., Amsterdam. First edition: 1958. Second edition: 1968. Republished in 1991 by Dover Publications, New York.
6. [1986] 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, Journal of Automated Reasoning, volume 2 (1986), pages 287-327.
7. [1998] Formisano, A. and Omodeo, E. G., An Equational Re-Engineering of Set Theories, presented at the FTP'98 International Workshop on First Order Theorem Proving (November 23-25, 1998).
8. [1940] 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.
9. [1960] Isbell, J. R., A Definition of Ordinal Numbers, The American Mathematical Monthly vol. 67 (1960), pp. 51-52.
10. [1994] McCune, W. W., Otter 3.0 Reference Manual and Guide, Argonne National Laboratory Report ANL-94/6, Argonne National Laboratory, Argonne, IL, January 1994.
11. [1997] Megill, N. D., Metamath: A Computer Language for Pure Mathematics, 1997.
12. [1993] Noël, P. A. J., Experimenting with Isabelle in ZF set theory, Journal of Automated Reasoning, vol. 10 (1993), pp. 15-58.
13. [1996] Paulson, L. C., and Grábczewski, K., Mechanizing Set Theory, Journal of Automated Reasoning, vol. 17, pp. 291-323 (1996).
14. [1992a] Quaife, A., Automated Deduction in von Neumann-Bernays-Gödel Set Theory, Journal of Automated Reasoning, vol. 8 (1992), pp. 91-147.
15. [1992b] Quaife, A., Automated Development of Fundamental Mathematical Theories, Ph.D. thesis, Univ. of California at Berkeley, Kluwer Acad. Publishers, Dordrecht, 1992.
16. [1987] Tarski, A., and Givant, S., A Formalization of Set Theory without Variables, American Mathematical Society Colloquium Publications, volume 41, Providence, Rhode Island, 1987.
17. [1988] Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice Hall, Englewood Cliffs, NJ, 1988.
18. [1989] Wos, L., The problem of finding an inference rule for set theory, Journal of Automated Reasoning, vol. 5 (1989), pp. 93-95.
19. [1992] Wos, L., Overbeek, R., Lusk, E. and Boyle, J., Automated Reasoning: Introduction and Applications, Second Edition, McGraw Hill, New York, 1992.
20. [1996] Wolfram, S., The MathematicaTM Book, Wolfram Media Inc., Champaign, Illinois, 1996.