On explicating the concept `the power of an arithmetical theory'

DOI10.1007/S10992-007-9077-8MaRDI QIDQ2481252zbMATH OpenOpenAlexFDO

Authors Jörgen Sjögren

Publication date 9 April 2008

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10992-007-9077-8

zbMATH Keywords

computational complexityrandomnessrecursion theoryalgorithmic information theoryaxiomatic set theory

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Consistency and independence results (03E35) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80) Ordinal and cardinal numbers (03E10)

Recommendations

• On interpreting Chaitin's incompleteness theorem
• scientific article; zbMATH DE number 5187689
• Algorithmic information theory
• Publication:4942681
• Publication:4942040

Cites work

• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 2014521 (Why is no real title available?)
• scientific article; zbMATH DE number 1548484 (Why is no real title available?)
• scientific article; zbMATH DE number 1414366 (Why is no real title available?)
• scientific article; zbMATH DE number 2198106 (Why is no real title available?)
• scientific article; zbMATH DE number 3289430 (Why is no real title available?)
• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic Information Theory
• Algorithmic information theory
• Algorithmic information theory and undecidability
• Classical recursion theory. Vol. II
• Extremely undecidable sentences
• Gödel's theorem and information
• Information-Theoretic Limitations of Formal Systems
• On interpreting Chaitin's incompleteness theorem
• Sharp estimates for the non-centered maximal operator associated to Gaussian and other radial measures.

Cited in

(2)

• The arithmetics of a theory
• Revisiting Chaitin's incompleteness theorem

This page was built for publication: On explicating the concept `the power of an arithmetical theory'

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