Computer proofs in Gödel's class theory with equational definitions for composite and cross
From MaRDI portal
Publication:1284711
DOI10.1023/A:1006050629424zbMath0922.68110OpenAlexW1502047167MaRDI QIDQ1284711
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:1006050629424
Related Items
Ordinal arithmetic: Algorithms and mechanization, Computer proofs about finite and regular sets: The unifying concept of subvariance., The GOEDEL program, Goals and benchmarks for automated map reasoning