Bulletin of Symbolic Logic 19 (4):473-490 (2013)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s107989860001057x
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,391
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Covering Analytic Sets by Families of Closed Sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Dominating and Unbounded Free Sets.Slawomir Solecki & Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (1):75-80.

Add more references

Citations of this work BETA

The Classification Problem for Automorphisms of C*-Algebras.Martino Lupini - 2015 - Bulletin of Symbolic Logic 21 (4):402-424.

Add more citations

Similar books and articles

Analytic Equivalence Relations and the Forcing Method.Jindřich Zapletal - 2013 - Bulletin of Symbolic Logic 19 (4):473-490.
Thin Equivalence Relations and Effective Decompositions.Greg Hjorth - 1993 - Journal of Symbolic Logic 58 (4):1153-1164.
Thin Equivalence Relations and Inner Models.Philipp Schlicht - 2014 - Annals of Pure and Applied Logic 165 (10):1577-1625.
Thin Equivalence Relations and Effective Decompositions.Greg Hjorth - 1994 - Journal of Symbolic Logic 59 (4):1153-1164.
Analytic Equivalence Relations and Bi-Embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
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.
? 0 N -Equivalence Relations.Andrea Sorbi - 1982 - Studia Logica 41 (4):351-358.
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
F Σ Equivalence Relations and Laver Forcing.Michal Doucha - 2014 - Journal of Symbolic Logic 79 (2):644-653.

Analytics

Added to PP index
2019-04-25

Total views
9 ( #848,873 of 2,326,144 )

Recent downloads (6 months)
1 ( #646,834 of 2,326,144 )

How can I increase my downloads?

Downloads

My notes