The Borel Complexity of Isomorphism for Theories with Many Types

Notre Dame Journal of Formal Logic 48 (1):93-97 (2007)
  Copy   BIBTEX

Abstract

During the Notre Dame workshop on Vaught's Conjecture, Hjorth and Kechris asked which Borel equivalence relations can arise as the isomorphism relation for countable models of a first-order theory. In particular, they asked if the isomorphism relation can be essentially countable but not tame. We show this is not possible if the theory has uncountably many types

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1172787547

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Borel complexity of isomorphism between quotient Boolean algebras.Su Gao & Michael Ray Oliver - 2008 - Journal of Symbolic Logic 73 (4):1328-1340.
A note on countable complete theories having three isomorphism types of countable models.Robert E. Woodrow - 1976 - Journal of Symbolic Logic 41 (3):672-680.
Cofinal families of Borel equivalence relations and quasiorders.Christian Rosendal - 2005 - Journal of Symbolic Logic 70 (4):1325-1340.
Continuum-many Boolean algebras of the form $\mathcal{p}(\omega)/\mathcal{I}, \mathcal{I}$ borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
Scientific representation: Against similarity and isomorphism.Mauricio Suárez - 2003 - International Studies in the Philosophy of Science 17 (3):225-244.
On the Borel classification of the isomorphism class of a countable model.Arnold W. Miller - 1983 - Notre Dame Journal of Formal Logic 24 (1):22-34.
Applications of large cardinals to borel functions.Harvey Friedman - manuscript
Synthetic analysis: How science combats complexity.Sunny Auyang - manuscript
A Silver-like Perfect Set Theorem with an Application to Borel Model Theory.Joël Combase - 2011 - Notre Dame Journal of Formal Logic 52 (4):415-429.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
Borel reducibility and classification of von Neumann algebras.Román Sasyk & Asger Törnquist - 2009 - Bulletin of Symbolic Logic 15 (2):169-183.
Complexity theories, social theory, and the question of social complexity.Peter Stewart - 2001 - Philosophy of the Social Sciences 31 (3):323-360.
Complexity and sustainability.Jennifer Wells - 2013 - New York: Routledge.

Analytics

Added to PP
2010-08-24

Downloads
22 (#688,104)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
Introduction to the Special Issue on Vaught's Conjecture.Peter Cholak - 2007 - Notre Dame Journal of Formal Logic 48 (1):1-2.

Add more citations

References found in this work

Models of arithmetic and closed ideals.Julia Knight & Mark Nadel - 1982 - Journal of Symbolic Logic 47 (4):833-840.
Expansions of models and Turing degrees.Julia Knight & Mark Nadel - 1982 - Journal of Symbolic Logic 47 (3):587-604.

Add more references