Switch to: References

Add citations

You must login to add citations.
  1. The ramified analytical hierarchy using extended logics.Philip D. Welch - 2018 - Bulletin of Symbolic Logic 24 (3):306-318.
    The use of Extended Logics to replace ordinary second order definability in Kleene’s Ramified Analytical Hierarchy is investigated. This mirrors a similar investigation of Kennedy, Magidor and Väänänen [11] where Gödel’s universe L of constructible sets is subjected to similar variance. Enhancing second order definability allows models to be defined which may or may not coincide with the original Kleene hierarchy in domain. Extending the logic with game quantifiers, and assuming strong axioms of infinity, we obtain minimal correct models of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Mathematical definability.Theodore A. Slaman - 1998 - In Harold Garth Dales & Gianluigi Oliveri (eds.), Truth in mathematics. New York: Oxford University Press, Usa. pp. 233.
    Download  
     
    Export citation  
     
    Bookmark  
  • Gaps in the contructable universe.W. Marek & M. Srebrny - 1974 - Annals of Mathematical Logic 6 (3):359-394.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An application of recursion theory to analysis.Liang Yu - 2020 - Bulletin of Symbolic Logic 26 (1):15-25.
    Mauldin [15] proved that there is an analytic set, which cannot be represented by $B\cup X$ for some Borel set B and a subset X of a $\boldsymbol{\Sigma }^0_2$ -null set, answering a question by Johnson [10]. We reprove Mauldin’s answer by a recursion-theoretical method. We also give a characterization of the Borel generated $\sigma $ -ideals having approximation property under the assumption that every real is constructible, answering Mauldin’s question raised in [15].
    Download  
     
    Export citation  
     
    Bookmark  
  • The next admissible ordinal.Richard Gostanian - 1979 - Annals of Mathematical Logic 17 (1):171.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • In Memoriam: George Stephen Boolos 1940–1996.Warren Goldfarb - 1996 - Bulletin of Symbolic Logic 2 (4):444-447.
    Download  
     
    Export citation  
     
    Bookmark  
  • The limits of "E"-recursive enumerability.G. E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Constructible β‐models.Herbert B. Enderton - 1973 - Mathematical Logic Quarterly 19 (14‐18):277-282.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Second order arithmetic and related topics.K. R. Apt & W. Marek - 1974 - Annals of Mathematical Logic 6 (3):177.
    Download  
     
    Export citation  
     
    Bookmark   13 citations