Switch to: Citations

Add references

You must login to add references.
  1. Forcing with tagged trees.John R. Steel - 1978 - Annals of Mathematical Logic 15 (1):55.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • On the Π1 1 -separation principle.Antonio Montalbán - 2008 - Mathematical Logic Quarterly 54 (6):563-578.
    We study the proof-theoretic strength of the Π11-separation axiom scheme, and we show that Π11-separation lies strictly in between the Δ11-comprehension and Σ11-choice axiom schemes over RCA0.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.
    A statement of hyperarithmetic analysis is a sentence of second order arithmetic S such that for every Y⊆ω, the minimum ω-model containing Y of RCA0 + S is HYP, the ω-model consisting of the sets hyperarithmetic in Y. We provide an example of a mathematical theorem which is a statement of hyperarithmetic analysis. This statement, that we call INDEC, is due to Jullien [13]. To the author's knowledge, no other already published, purely mathematical statement has been found with this property (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations