Borel equivalence relations and classifications of countable models

Annals of Pure and Applied Logic 82 (3):221-272 (1996)
  Copy   BIBTEX

Abstract

Using the theory of Borel equivalence relations we analyze the isomorphism relation on the countable models of a theory and develop a framework for measuring the complexity of possible complete invariants for isomorphism

Links

PhilArchive



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

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

Borel equivalence relations which are highly unfree.Greg Hjorth - 2008 - Journal of Symbolic Logic 73 (4):1271-1277.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Continuous versus Borel reductions.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):761-770.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Borel structures and borel theories.Greg Hjorth & André Nies - 2011 - Journal of Symbolic Logic 76 (2):461 - 476.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.

Analytics

Added to PP
2014-01-16

Downloads
13 (#973,701)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?