Finite sets and Gödel's incompleteness theorems
From MaRDI portal
Publication:4829437
DOI10.4064/dm422-0-1zbMath1058.03065OpenAlexW192540218WikidataQ56853389 ScholiaQ56853389MaRDI QIDQ4829437
Publication date: 29 November 2004
Published in: Dissertationes Mathematicae (Search for Journal in Brave)
Full work available at URL: http://journals.impan.gov.pl/dm/Cont/dm422-0.html
First-order arithmetic and fragments (03F30) Axiomatics of classical set theory and its fragments (03E30) Gödel numberings and issues of incompleteness (03F40)
Related Items (10)
A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle ⋮ A Formalisation of Finite Automata Using Hereditarily Finite Sets ⋮ A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS ⋮ A step towards absolute versions of metamathematical results ⋮ The scope of Gödel's first incompleteness theorem ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem ⋮ Distilling the requirements of Gödel's incompleteness theorems with a proof assistant ⋮ A formally verified abstract account of Gödel's incompleteness theorems ⋮ Hereditarily Finite Sets in Constructive Type Theory ⋮ Addition and multiplication of sets
This page was built for publication: Finite sets and Gödel's incompleteness theorems