On Computer-Assisted Proofs in Ordinal Number Theory

Authors:
Johan G. F. Belinfante
Affiliations:
School of Mathematics, Georgia Institute of Technology
Venue:
Journal of Automated Reasoning
Year:
1999

Citing 6
Cited 4

Introduction to mathematical logic; (3rd ed.)

Introduction to mathematical logic; (3rd ed.)
Set theory in first-order logic: clauses for Go¨del's axioms

Journal of Automated Reasoning
Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems
Mathematica: a system for doing mathematics by computer (2nd ed.)

Mathematica: a system for doing mathematics by computer (2nd ed.)
Automated deduction in von Neumann-Bernays-Go¨del set theory

Journal of Automated Reasoning
Automated development of fundamental mathematical theories

Automated development of fundamental mathematical theories

Computer proofs about finite and regular sets: the unifying concept of subvariance

Journal of Symbolic Computation - Special issue: First order theorem proving
The Relative Consistency of the Axiom of Choice -- Mechanized Using Isabelle/ZF

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The GOEDEL Program

Journal of Automated Reasoning
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.