论文信息 - On Computer-Assisted Proofs in Ordinal Number Theory

On Computer-Assisted Proofs in Ordinal Number Theory

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.

Johan G. F. Belinfante | J. Belinfante

[1] Jean E. Rubin,et al. Set theory for the mathematician , 1967 .

[2] Elliott Mendelson,et al. Introduction to Mathematical Logic , 1979 .

[3] Johan G. F. Belinfante. Gödel's Algorithm for Class Formation , 2000, CADE.

[4] Art Quaife,et al. Automated deduction in von Neumann-Bernays-Gödel set theory , 1992, Journal of Automated Reasoning.

[5] J. Isbell. A Definition of Ordinal Numbers , 1960 .

[6] Larry Wos,et al. Set theory in first-order logic: Clauses for Gödel's axioms , 1986, Journal of Automated Reasoning.

[7] Stephen Wolfram,et al. Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .

[8] William McCune,et al. OTTER 3.0 Reference Manual and Guide , 1994 .

[9] K. Gödel. The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis. , 1938, Proceedings of the National Academy of Sciences of the United States of America.

[10] R. Fateman,et al. A System for Doing Mathematics by Computer. , 1992 .

[11] Anthony Preston,et al. Book review: Automated Reasoning: 33 Basic Research Problems by Larry Wos (Prentice Hall 1988) , 1988, SGAR.

[12] Larry Wos,et al. Automated reasoning - 33 basic research problems , 1988 .

[13] J. W. Addison,et al. Automated development of fundamental mathematical theories , 1992 .