Switch to: Citations

Add references

You must login to add references.
  1. The Concept of Truth in Formalized Languages.Alfred Tarski - 1936 - In A. Tarski (ed.), Logic, Semantics, Metamathematics. Oxford University Press. pp. 152--278.
    Download  
     
    Export citation  
     
    Bookmark   314 citations  
  • On Interpreting Chaitin's Incompleteness Theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
    The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good measure of (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • Algorithmic Information Theory.Peter Gacs - 1989 - Journal of Symbolic Logic 54 (2):624-627.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • Trial and Error Predicates and the Solution to a Problem of Mostowski.Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):49-57.
    Download  
     
    Export citation  
     
    Bookmark   63 citations  
  • Algorithmic Information Theory.Michiel van Lambalgen - 1989 - Journal of Symbolic Logic 54 (4):1389-1400.
    We present a critical discussion of the claim (most forcefully propounded by Chaitin) that algorithmic information theory sheds new light on Godel's first incompleteness theorem.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   514 citations  
  • Sentences Undecidable in Formalized Arithmetic: An Exposition of the Theory of Kurt Gödel.A. Mostowski - 1953 - British Journal for the Philosophy of Science 3 (12):364-374.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.G. Kreisel & A. Lévy - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (7-12):97-142.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
    Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Theory of Recursive Functions and Effective Computability.H. Rogers - 1987 - MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   442 citations  
  • A Mathematical Incompleteness in Peano Arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 90--1133.
    Download  
     
    Export citation  
     
    Bookmark   45 citations  
  • Sentences Undecidable in Formalized Arithmetic: An Exposition of the Theory of Kurt Gödel.Andrzej Mostowski - 1952 - Greenwood Press.
    Download  
     
    Export citation  
     
    Bookmark   10 citations