On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos (Q2910986): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4339021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic computation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Berry paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Models Constructed by Means of the Arithmetized Completeness Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalization of model-theoretic proofs of Gödel's theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Boolos' Proof of the Incompleteness Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and the second incompleteness theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the incompleteness theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incompleteness theorems after 70 years / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Surprise Examination Paradox and the Second Incompleteness Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest definition of a number in Peano arithmetic / rank
 
Normal rank

Latest revision as of 16:53, 5 July 2024

scientific article
Language Label Description Also known as
English
On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
scientific article

    Statements

    On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    incompleteness theorems
    0 references
    Berry's paradox
    0 references
    Kolmogorov complexity
    0 references
    0 references