Kolmogorov complexity and the second incompleteness theorem

DOI10.1007/S001530050074zbMATH Open0883.03042OpenAlexW2085869676MaRDI QIDQ1374675FDOQ1374675

Authors: Makoto Kikuchi 

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

Recommendations

• On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
• Is complexity a source of incompleteness?
• The surprise examination paradox and the second incompleteness theorem
• The Berry paradox
• The axiomatic power of Kolmogorov complexity

zbMATH Keywords

Kolmogorov complexitysecond incompleteness theorem

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) First-order arithmetic and fragments (03F30)

Cited In (10)

• Randomness and intractability in Kolmogorov complexity
• Current research on Gödel's incompleteness theorems
• The incompleteness theorems after 70 years
• Acceptable complexity measures of theorems
• Existentially closed structures and Gödel's second incompleteness theorem
• Kolmogorov Complexity and Noncomputability
• On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
• The surprise examination paradox and the second incompleteness theorem
• The axiomatic power of Kolmogorov complexity
• INCOMPLETENESS VIA PARADOX AND COMPLETENESS

This page was built for publication: Kolmogorov complexity and the second incompleteness theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374675)