On computer-assisted proofs in ordinal number theory

DOI10.1023/A:1006010913494zbMath0922.68111OpenAlexW1708264985MaRDI QIDQ1284712

Johan Gijsbertus Frederik Belinfante

Publication date: 26 April 1999

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1006010913494

zbMATH Keywords

OTTERGödel's class theoryordinal number theory

Mathematics Subject Classification ID

Related Items

Ordinal arithmetic: Algorithms and mechanization, The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF, Computer proofs about finite and regular sets: The unifying concept of subvariance., The GOEDEL program, Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\), Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets