Switch to: References

Add citations

You must login to add citations.
  1. Preserving levels of projective determinacy by tree forcings.Fabiana Castiblanco & Philipp Schlicht - 2021 - Annals of Pure and Applied Logic 172 (4):102918.
    We prove that various classical tree forcings—for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing—preserve the statement that every real has a sharp and hence analytic determinacy. We then lift this result via methods of inner model theory to obtain level-by-level preservation of projective determinacy (PD). Assuming PD, we further prove that projective generic absoluteness holds and no new equivalence classes are added to thin projective transitive relations by these forcings.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Equivalence relations which are borel somewhere.William Chan - 2017 - Journal of Symbolic Logic 82 (3):893-930.
    The following will be shown: Let I be a σ-ideal on a Polish space X so that the associated forcing of I+${\bf{\Delta }}_1^1$ sets ordered by ⊆ is a proper forcing. Let E be a ${\bf{\Sigma }}_1^1$ or a ${\bf{\Pi }}_1^1$ equivalence relation on X with all equivalence classes ${\bf{\Delta }}_1^1$. If for all $z \in {H_{{{\left}^ + }}}$, z♯ exists, then there exists an I+${\bf{\Delta }}_1^1$ set C ⊆ X such that E ↾ C is a ${\bf{\Delta }}_1^1$ equivalence (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Thin equivalence relations and inner models.Philipp Schlicht - 2014 - Annals of Pure and Applied Logic 165 (10):1577-1625.
    We describe the inner models with representatives in all equivalence classes of thin equivalence relations in a given projective pointclass of even level assuming projective determinacy. The main result shows that these models are characterized by their correctness and the property that they correctly compute the tree from the appropriate scale. The main step towards this characterization shows that the tree from a scale can be reconstructed in a generic extension of an iterate of a mouse. We then construct models (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Analytic equivalence relations and Ulm-type classifications.Greg Hjorth & Alexander S. Kechris - 1995 - Journal of Symbolic Logic 60 (4):1273-1300.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Linearization of definable order relations.Vladimir Kanovei - 2000 - Annals of Pure and Applied Logic 102 (1-2):69-100.
    We prove that if ≼ is an analytic partial order then either ≼ can be extended to a Δ 2 1 linear order similar to an antichain in 2 ω 1 , ordered lexicographically, or a certain Borel partial order ⩽ 0 embeds in ≼. Similar linearization results are presented, for κ -bi-Souslin partial orders and real-ordinal definable orders in the Solovay model. A corollary for analytic equivalence relations says that any Σ 1 1 equivalence relation E , such that (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Some applications of illfoundedness.Greg Hjorth - 1996 - Archive for Mathematical Logic 35 (3):131-144.
    It is possible to completely characterize which countable models generated by 0# exist inL. This in turn has applications in the study of analytic equivalence relations; for instance, ifE is∑ 1 1 and every invariant∑ 1 1 (0#) set isΔ 1 1 , thenE has at most ℵ0 many equivalence classes.
    Download  
     
    Export citation  
     
    Bookmark