Finding 2^_0 countable models for ordered theories
From MaRDI portal
Publication:1669769
DOI10.17377/SEMI.2018.15.057zbMATH Open1436.03183MaRDI QIDQ1669769FDOQ1669769
Authors: Bektur Sembiuly Baizhanov, John T. Baldwin, Tat'yana Sergeevna Zambarnaya 
Publication date: 4 September 2018
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Recommendations
- Countable models of \(\aleph_ 1\)-categorical, but not \(\aleph_ 0\)-categorical theories
- On the number of countable models of complete theories with finite Rudin-Keisler preorders
- Complete theories with finitely many countable models. II
- scientific article; zbMATH DE number 871450
- scientific article; zbMATH DE number 2063230
- Stationarily ordered types and the number of countable models
- On the number of countable models of stable theories
- A countable model for the theory of complete dense binary order
- On the number of models of uncountable theories
- On theories having a finite number of nonisomorphic countable models
Model theory of ordered structures; o-minimality (03C64) Model theory of denumerable and separable structures (03C15)
Cites Work
Cited In (8)
- On countably saturated linear orders and certain class of countably saturated graphs
- The model \(N=\cup \{L[A]:\) A countable set of ordinals\(\}\)
- Non-existence of uniformly definable family of convex equivalence relations in an 1-type of small ordered theories and maximal number of models
- A countable model for the theory of complete dense binary order
- Discrete order on a definable set and the number of models
- Types directed by constants
- A.D. Taimanov and model theory in Kazakhstan
- Constructing many atomic models in \(\aleph_1\)
This page was built for publication: Finding \(2^{\aleph_0}\) countable models for ordered theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1669769)
