Countable Models of Trivial Theories which Admit Finite Coding

&
Journal of Symbolic Logic 61 (3):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^{\aleph_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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

External links

  • This entry has no external links. Add one.
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 Tanović - 1996 - Journal of Symbolic Logic 61 (4):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 atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.
On omega-categorical simple theories.Daniel Palacín - 2012 - Archive for Mathematical Logic 51 (7-8):709-717.
Theories with constants and three countable models.Predrag Tanović - 2007 - Archive for Mathematical Logic 46 (5-6):517-527.
The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
Constructing strongly equivalent nonisomorphic models for unstable theories.Tapani Hyttinen & Heikki Tuuri - 1991 - Annals of Pure and Applied Logic 52 (3):203-248.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
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.
Stable theories, pseudoplanes and the number of countable models.Anand Pillay - 1989 - Annals of Pure and Applied Logic 43 (2):147-160.
Tiny models of categorical theories.M. C. Laskowski, A. Pillay & P. Rothmaler - 1992 - Archive for Mathematical Logic 31 (6):385-396.

Analytics

Added to PP
2017-02-21

Downloads
2 (#1,800,073)

6 months
1 (#1,469,469)

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.

Add more citations

References found in this work

No references found.

Add more references