On explicating the concept `the power of an arithmetical theory'
DOI10.1007/S10992-007-9077-8zbMATH Open1146.03004OpenAlexW2091409696MaRDI QIDQ2481252FDOQ2481252
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
Recommendations
computational complexityrandomnessrecursion theoryalgorithmic information theoryaxiomatic set theory
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)
Cites Work
- A Theory of Program Size Formally Identical to Information Theory
- Sharp estimates for the non-centered maximal operator associated to Gaussian and other radial measures.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Information-Theoretic Limitations of Formal Systems
- Classical recursion theory. Vol. II
- On interpreting Chaitin's incompleteness theorem
- Gödel's theorem and information
- Title not available (Why is that?)
- Algorithmic Information Theory
- Algorithmic information theory
- Title not available (Why is that?)
- Extremely undecidable sentences
- Title not available (Why is that?)
- Algorithmic information theory and undecidability
Cited In (2)
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)
