Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Kolmogorov complexity and the second incompleteness theorem

From MaRDI portal
Publication:1374675
Jump to:navigation, search

DOI10.1007/s001530050074zbMath0883.03042OpenAlexW2085869676MaRDI QIDQ1374675

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

zbMATH Keywords

Kolmogorov complexitysecond incompleteness theorem


Mathematics Subject Classification ID

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1374675&oldid=13519937"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki