Countable models of trivial theories which admit finite coding

DOI10.2307/2275816MaRDI QIDQ3128473zbMATH OpenOpenAlexFDO

Authors James Loveys, Predrag Tanović

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

zbMATH Keywords

countable modelsfinite codingstable theorysuperstable typesymmetry lemmatrivial theoryVaught's conjecture

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Classification theory, stability, and related concepts in model theory (03C45)

Recommendations

• Powerful types in small theories
• Countable Models of Stable Theories
• A note on tight stable theorie
• On the number of countable models of stable theories
• On U-Rank 2 Types
• Classification theory for a 1-ary function
• Non-isolated types in stable theories
• On minimal structures
• Finitely based theories
• A note on countable models of 1-based theories

Cites work

• Finitely based theories
• scientific article; zbMATH DE number 40985 (Why is no real title available?)

Cited in

(2)

• On constants and the strict order property
• Non-isolated types in stable theories

This page was built for publication: Countable models of trivial theories which admit finite coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128473)