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

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

Citing 4
Cited 5

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 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
Automated deduction for verification

ACM Computing Surveys (CSUR)
A finite first-order theory of classes

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Combining type theory and untyped set theory

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
The GOEDEL Program

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.