Switch to: References

Citations of:

Unraveling Π11 sets

Annals of Pure and Applied Logic 106 (1-3):151-205 (2000)

Add citations

You must login to add citations.
  1. Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
    We give upper and lower bounds for the strength of ordinal definable determinacy in a small admissible set. The upper bound is roughly a premouse with a measurable cardinal $\kappa$ of Mitchell order $\kappa^{++}$ and $\omega$ successors. The lower bound are models of ZFC with sequences of measurable cardinals, extending the work of Lewis, below a regular limit of measurable cardinals.
    Download  
     
    Export citation  
     
    Bookmark  
  • Determinacy for Games Ending at the First Admissible Relative to the Play.Itay Neeman - 2006 - Journal of Symbolic Logic 71 (2):425 - 459.
    Let o(κ) denote the Mitchell order of κ. We show how to reduce long games which run to the first ordinal admissible in the play, to iteration games on models with a cardinal κ so that (1) κ is a limit of Woodin cardinals: and (2) o(κ) = κ⁺⁺. We use the reduction to derive several optimal determinacy results on games which run to the first admissible in the play.
    Download  
     
    Export citation  
     
    Bookmark