An Ulm-type classification theorem for equivalence relations in Solovay model

Journal of Symbolic Logic 62 (4):1333-1351 (1997)
  Copy   BIBTEX

Abstract

We prove that in the Solovay model, every OD equivalence relation, E, over the reals, either admits an OD reduction to the equality relation on the set of all countable (of length $ ) binary sequences, or continuously embeds E 0 , the Vitali equivalence. If E is a Σ 1 1 (resp. Σ 1 2 ) relation then the reduction above can be chosen in the class of all ▵ 1 (resp. ▵ 2 ) functions. The proofs are based on a topology generated by OD sets

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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

Linearization of definable order relations.Vladimir Kanovei - 2000 - Annals of Pure and Applied Logic 102 (1-2):69-100.
Equivalence relations which are borel somewhere.William Chan - 2017 - Journal of Symbolic Logic 82 (3):893-930.
Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
Countable OD sets of reals belong to the ground model.Vladimir Kanovei & Vassily Lyubetsky - 2018 - Archive for Mathematical Logic 57 (3-4):285-298.
Exact equiconsistency results for Δ 3 1 -sets of reals.Haim Judah - 1992 - Archive for Mathematical Logic 32 (2):101-112.
Some applications of coarse inner model theory.Greg Hjorth - 1997 - Journal of Symbolic Logic 62 (2):337-365.
Two results on borel orders.Alain Louveau - 1989 - Journal of Symbolic Logic 54 (3):865-874.
On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.

Analytics

Added to PP
2009-01-28

Downloads
69 (#304,173)

6 months
11 (#338,628)

Historical graph of downloads
How can I increase my downloads?

Author's Profile