An Unclassifiable Unidimensional Theory without OTOP

Notre Dame Journal of Formal Logic 38 (1):93-103 (1997)
  Copy   BIBTEX

Abstract

A countable unidimensional theory without the omitting types order property (OTOP) has prime models over pairs and is hence classifiable. We show that this is not true for uncountable unidimensional theories

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,824

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 countable simple unidimensional theories.Anand Pillay - 2003 - Journal of Symbolic Logic 68 (4):1377-1384.
On uncountable hypersimple unidimensional theories.Ziv Shami - 2014 - Archive for Mathematical Logic 53 (1-2):203-210.
Unidimensional theories are superstable.Ehud Hrushovski - 1990 - Annals of Pure and Applied Logic 50 (2):117-138.
Unidimensional theories are superstable.Katsuya Eda - 1990 - Annals of Pure and Applied Logic 50 (2):117-137.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Continuity of SU-rank in unidimensional supersimple theories.Ziv Shami - 2016 - Archive for Mathematical Logic 55 (5-6):663-675.
The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
On Kueker Simple Theories.Ziv Shami - 2005 - Journal of Symbolic Logic 70 (1):216 - 222.

Analytics

Added to PP
2010-08-24

Downloads
24 (#1,015,145)

6 months
4 (#1,021,603)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations