Classification theory and 0#

Journal of Symbolic Logic 68 (2):580-588 (2003)

Abstract

We characterize the classifiability of a countable first-order theory T in terms of the solvability of the potential-isomorphism problem for models of T.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,694

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
15 (#703,879)

6 months
1 (#388,319)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

Similar books and articles

On Potential Isomorphism and Non-Structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.
Comparing Borel Reducibility and Depth of an Ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
A Complicated Ω-Stable Depth 2 Theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
Classification Theory Through Stationary Logic.Fred Appenzeller - 2000 - Annals of Pure and Applied Logic 102 (1-2):27-68.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Classifying Emotions: Prospects for a Psychoevolutionary Approach.Charles Starkey - 2008 - Philosophical Psychology 21 (6):759 – 777.
Statistical Learning Theory: A Tutorial.Sanjeev R. Kulkarni & Gilbert Harman - 2011 - Wiley Interdisciplinary Reviews: Computational Statistics 3 (6):543-556.
Narrative, Morality and Religion.J. Wesley Robbins - 1980 - Journal of Religious Ethics 8 (1):161 - 176.
Classificatory Theory in Biology.Sabina Leonelli - 2013 - Biological Theory 7 (4):338-345.