Countable models of trivial theories which admit finite coding
From MaRDI portal
Publication:3128473
DOI10.2307/2275816zbMath0871.03022OpenAlexW2075192103MaRDI QIDQ3128473
Publication date: 20 August 1997
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275816
stable theorycountable modelsVaught's conjecturetrivial theoryfinite codingsuperstable typesymmetry lemma
Classification theory, stability, and related concepts in model theory (03C45) Model theory of denumerable and separable structures (03C15)
Related Items
Cites Work