Switch to: Citations

Add references

You must login to add references.
  1. On Formally Undecidable Propositions of Principia Mathematica and Related Systems.Kurt Gödel - 1931 - New York, NY, USA: Basic Books.
    First English translation of revolutionary paper that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • (3 other versions)Algorithmic Information Theory.Peter Gacs - 1989 - Journal of Symbolic Logic 54 (2):624-627.
    Download  
     
    Export citation  
     
    Bookmark   60 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   12 citations  
  • Barkley Rosser. Extensions of some theorems of Gödel and Church. The journal of symbolic logic, vol. 1 (1936), pp. 87–91. [REVIEW]Paul Bernays & Barkley Rosser - 1937 - Journal of Symbolic Logic 2 (1):52-53.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133.
    Download  
     
    Export citation  
     
    Bookmark   63 citations