Countable models of trivial theories which admit finite coding

&
Journal of Symbolic Logic 61 (4):1279-1286 (1996)
  Copy   BIBTEX

Abstract

We prove: Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has 2 ℵ 0 nonisomorphic countable models. Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding

Categories

Keywords

Reprint years

DOI

10.2307/2275816

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

On uniqueness of prime models.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (2):215-220.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
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.
Reducts of Stable, CM-Trivial Theories.Herwig Nübling - 2005 - Journal of Symbolic Logic 70 (4):1025 - 1036.
On theories having a finite number of nonisomorphic countable models.Akito Tsuboi - 1985 - Journal of Symbolic Logic 50 (3):806-808.
The spectrum of resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.
On the strong Martin conjecture.Masanori Itai - 1991 - Journal of Symbolic Logic 56 (3):862-875.
On the number of nonisomorphic models of size |t|.Ambar Chowdhury - 1994 - Journal of Symbolic Logic 59 (1):41 - 59.
On atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.

Analytics

Added to PP
2009-01-28

Downloads
215 (#94,488)

6 months
8 (#370,225)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On constants and the strict order property.Predrag Tanović - 2006 - Archive for Mathematical Logic 45 (4):423-430.
Non-isolated types in stable theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.

Add more citations

References found in this work

Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.

Add more references