Thin equivalence relations and inner models

Annals of Pure and Applied Logic 165 (10):1577-1625 (2014)
  Copy   BIBTEX


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 with this property as generic extensions of iterates of mice under the assumption that the corresponding projective ordinal is below ω2ω2. On the way, we consider several related problems, including the question when forcing does not add equivalence classes to thin projective equivalence relations. For instance, we show that if every set has a sharp, then reasonable forcing does not add equivalence classes to thin provably View the MathML source Δ1/3 equivalence relations, and generalize this to all projective levels



    Upload a copy of this work     Papers currently archived: 92,261

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
Thin equivalence relations in scaled pointclasses.Ralf Schindler & Philipp Schlicht - 2011 - Mathematical Logic Quarterly 57 (6):615-620.
Some applications of coarse inner model theory.Greg Hjorth - 1997 - Journal of Symbolic Logic 62 (2):337-365.
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
Maximal R.e. Equivalence relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
Analytic equivalence relations and the forcing method.Jindřich Zapletal - 2013 - Bulletin of Symbolic Logic 19 (4):473-490.
Some applications of illfoundedness.Greg Hjorth - 1996 - Archive for Mathematical Logic 35 (3):131-144.
Solovay models and forcing extensions.Joan Bagaria & Roger Bosch - 2004 - Journal of Symbolic Logic 69 (3):742-766.
? 0 N -equivalence relations.Andrea Sorbi - 1982 - Studia Logica 41 (4):351-358.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
On Borel equivalence relations in generalized Baire space.Sy-David Friedman & Tapani Hyttinen - 2012 - Archive for Mathematical Logic 51 (3-4):299-304.


Added to PP

23 (#685,787)

6 months
10 (#276,350)

Historical graph of downloads
How can I increase my downloads?

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
The Higher Infinite.Akihiro Kanamori - 2000 - Studia Logica 65 (3):443-446.
Set theory.Thomas Jech - 1981 - Journal of Symbolic Logic.
Admissible Sets and Structures.Jon Barwise - 1978 - Studia Logica 37 (3):297-299.

View all 28 references / Add more references