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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
Thin equivalence relations and effective decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
Maximal R.e. Equivalence relations.Jeffrey S. Carroll - 1990 - Journal of Symbolic Logic 55 (3):1048-1058.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
? 0 N -equivalence relations.Andrea Sorbi - 1982 - Studia Logica 41 (4):351-358.
Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.

Analytics

Added to PP
2009-01-28

Downloads
55 (#278,841)

6 months
18 (#127,601)

Historical graph of downloads
How can I increase my downloads?

Author's Profile