Skip to main content
Journal of Symbolic LogicVolume 61, Issue 4, December 1996, Pages 1279-1286

Countable models of trivial theories which admit finite coding(Article)

  Save all to author list
  • Dept. of Mathematics and Statistics, Mcgill University, 805 Sherbrooke West Montreal, Montreal, Que. H3A 2K6, Canada

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 N0 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.

  • ISSN: 00224812
  • Source Type: Journal
  • Original language: English
  • DOI: 10.2307/2275816
  • Document Type: Article
  • Publisher: Association for Symbolic Logic

  Loveys, J.; Dept. of Mathematics and Statistics, Mcgill University, 805 Sherbrooke West Montreal, Canada;
© Copyright 2017 Elsevier B.V., All rights reserved.

Cited by 3 documents

Tanović, P.
Non-isolated types in stable theories
(2007) Annals of Pure and Applied Logic
Tanović, P.
On constants and the strict order property
(2006) Archive for Mathematical Logic
Puninskaya, V.A.
Vaught's conjecture
(2002) Journal of Mathematical Sciences
View details of all 3 citations
Inform me when this document is cited in Scopus:
Set citation alert Set citation feed
{"topic":{"name":"Simple Theory; Minimality; Number","id":10389,"uri":"Topic/10389","prominencePercentile":62.182346,"prominencePercentileString":"62.182","overallScholarlyOutput":0},"dig":"6d1305c4be4354b1ded52b8f2f9a5270f66e97270d7687bf5f15317b12463169"}

SciVal Topic Prominence

Topic:
Prominence percentile: