Article contents
Countable models of trivial theories which admit finite coding
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1996
References
REFERENCES
- 2
- Cited by