Switch to: References

Add citations

You must login to add citations.
  1. Consistency results about ordinal definability.Kenneth McAloon - 1971 - Annals of Mathematical Logic 2 (4):449.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  • Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
    This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays (1939) and also how it was later adapted by Kreisel (1950) and Wang (1955) in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • The spectrum of elementary embeddings j: V→ V.Paul Corazza - 2006 - Annals of Pure and Applied Logic 139 (1):327-399.
    In 1970, K. Kunen, working in the context of Kelley–Morse set theory, showed that the existence of a nontrivial elementary embedding j:V→V is inconsistent. In this paper, we give a finer analysis of the implications of his result for embeddings V→V relative to models of ZFC. We do this by working in the extended language , using as axioms all the usual axioms of ZFC , along with an axiom schema that asserts that j is a nontrivial elementary embedding. Without (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations