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

DOI10.1016/S0747-7171(03)00023-3zbMath1039.68115OpenAlexW2027206952MaRDI QIDQ1404990

Johan Gijsbertus Frederik Belinfante

Publication date: 25 August 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(03)00023-3

zbMATH Keywords

FiniteRegularitySubvariance

Mathematics Subject Classification ID

Related Items

Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets

Uses Software

• OTTER
• Metamath

Cites Work

• Axiomatic set theory. With a historical introduction by Abraham A. Fraenkel
• Set theory in first-order logic: Clauses for Gödel's axioms
• Automated deduction in von Neumann-Bernays-Gödel set theory
• Computer proofs in Gödel's class theory with equational definitions for composite and cross
• On computer-assisted proofs in ordinal number theory
• Experimenting with Isabelle in ZF set theory
• On equivalents of well-foundedness. An experiment in MIZAR
• A theorem on n-tuples which is equivalent to the well-ordering theorem
• A Definition of Ordinal Numbers
• Consistency of the Continuum Hypothesis. (AM-3)
• Mechanizing set theory. Cardinal arithmetic and the axiom of choice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item