Kolmogorov complexity and the second incompleteness theorem
From MaRDI portal
Publication:1374675
DOI10.1007/s001530050074zbMath0883.03042OpenAlexW2085869676MaRDI QIDQ1374675
Publication date: 10 December 1997
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001530050074
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) First-order arithmetic and fragments (03F30)
Related Items
On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos, The incompleteness theorems after 70 years, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Existentially closed structures and Gödel's second incompleteness theorem, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, Randomness and Intractability in Kolmogorov Complexity