On Σ1 1 equivalence relations with Borel classes of bounded rank

Journal of Symbolic Logic 49 (4):1273 - 1283 (1984)
  Copy   BIBTEX

Abstract

In Baire space N = ω ω we define a sequence of equivalence relations $\langle E_\nu| \nu , each E v being Σ 1 1 with classes in Π 0 1 + ν + 1 and such that (i) E ν does not have perfectly many classes, and (ii) N/E ν is countable iff $\omega^L_\nu . This construction can be extended cofinally in (δ 1 3 ) L . A new proof is given of a theorem of Hausdorff on partitions of R into ω 1 many Π 0 3 sets

Other Versions

No versions found

Similar books and articles

Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
The equivalence of determinacy and iterated sharps.Derrick Albert Dubose - 1990 - Journal of Symbolic Logic 55 (2):502-525.
Linearization of definable order relations.Vladimir Kanovei - 2000 - Annals of Pure and Applied Logic 102 (1-2):69-100.
Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374-382.
Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
The Σ 2 1 theory of axioms of symmetry.Galen Weitkamp - 1989 - Journal of Symbolic Logic 54 (3):727-734.
Exact equiconsistency results for Δ 3 1 -sets of reals.Haim Judah - 1992 - Archive for Mathematical Logic 32 (2):101-112.

Analytics

Added to PP
2009-01-28

Downloads
294 (#146,991)

6 months
21 (#526,939)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Π11 Borel sets.Alexander S. Kechris, David Marker & Ramez L. Sami - 1989 - Journal of Symbolic Logic 54 (3):915 - 920.
On effective σ‐boundedness and σ‐compactness.Vladimir Kanovei & Vassily Lyubetsky - 2013 - Mathematical Logic Quarterly 59 (3):147-166.

Add more citations

References found in this work

Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
Higher set theory and mathematical practice.Harvey M. Friedman - 1971 - Annals of Mathematical Logic 2 (3):325.

Add more references