Countable Models of Trivial Theories which Admit Finite Coding

Loveys, James; Tanovic, Predrag

J. Symbolic Logic, Tome 61 (1996) no. 1, p. 1279-1286 / Harvested from Project Euclid

Résumé

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.

Publié le : 1996-12-14
Classification:

@article{1183745135,
     author = {Loveys, James and Tanovic, Predrag},
     title = {Countable Models of Trivial Theories which Admit Finite Coding},
     journal = {J. Symbolic Logic},
     volume = {61},
     number = {1},
     year = {1996},
     pages = { 1279-1286},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183745135}
}

Loveys, James; Tanovic, Predrag. Countable Models of Trivial Theories which Admit Finite Coding. J. Symbolic Logic, Tome 61 (1996) no. 1, pp.  1279-1286. http://gdmltest.u-ga.fr/item/1183745135/