A note on countable complete theories having three isomorphism types of countable models

Journal of Symbolic Logic 41 (3):672-680 (1976)
  Copy   BIBTEX

Abstract

With quantifier elimination and restriction of language to a binary relation symbol and constant symbols it is shown that countable complete theories having three isomorphism types of countable models are "essentially" the Ehrenfeucht example [4, $\s6$ ]

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

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

The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Theories with constants and three countable models.Predrag Tanović - 2007 - Archive for Mathematical Logic 46 (5-6):517-527.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
Types directed by constants.Predrag Tanović - 2010 - Annals of Pure and Applied Logic 161 (7):944-955.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.

Analytics

Added to PP
2009-01-28

Downloads
9 (#449,242)

6 months
81 (#201,181)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Theories with constants and three countable models.Predrag Tanović - 2007 - Archive for Mathematical Logic 46 (5-6):517-527.
Semi-Isolation and the Strict Order Property.Sergey Sudoplatov & Predrag Tanović - 2015 - Notre Dame Journal of Formal Logic 56 (4):555-572.

Add more citations

References found in this work

Mathematical Logic.Donald Monk - 1975 - Journal of Symbolic Logic 40 (2):234-236.

Add more references