Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-19T05:07:47.041Z Has data issue: false hasContentIssue false

Countable models of trivial theories which admit finite coding

Published online by Cambridge University Press:  12 March 2014

James Loveys
Affiliation:
Department of Mathematics and Statistics, Mcgill University, 805 Sherbrooke West, Montreal, Quebec, CanadaH3A 2K6, E-mail: loveys@triples.math.mcgill.ca
Predrag Tanović
Affiliation:
Matematiǩi institut, Knez Mihajlova 35, 11001 Beograd, Yugoslavia, and Department of Mathematics and Statistics, Mcgill University, 805 Sherbrooke West Montreal, Quebec, CanadaH3A 2K6

Abstract

We prove:

Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding hasnonisomorphic 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable