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: 93,590

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

Countable Models of Trivial Theories which Admit Finite Coding.James Loveys & Predrag Tanovic - 1996 - Journal of Symbolic Logic 61 (3):1279-1286.
Non-isolated types in stable theories.Predrag Tanović - 2007 - Annals of Pure and Applied Logic 145 (1):1-15.
Vaught’s conjecture for superstable theories of finite rank.Steven Buechler - 2008 - Annals of Pure and Applied Logic 155 (3):135-172.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
A note on countable models of 1-based theories.Predrag Tanovic - 2002 - Archive for Mathematical Logic 41 (7):669-671.
On omega-categorical simple theories.Daniel Palacín - 2012 - Archive for Mathematical Logic 51 (7-8):709-717.
The spectrum of resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.
On theories having a finite number of nonisomorphic countable models.Akito Tsuboi - 1985 - Journal of Symbolic Logic 50 (3):806-808.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
On atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.

Analytics

Added to PP
2009-01-28

Downloads
217 (#14,812)

6 months
10 (#1,198,792)

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