Finding 2^_0 countable models for ordered theories
From MaRDI portal
Publication:1669769
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
Cites work
- scientific article; zbMATH DE number 5148399 (Why is no real title available?)
- scientific article; zbMATH DE number 1533632 (Why is no real title available?)
- Discrete order on a definable set and the number of models
- Model theory.
- Theories of linear order
- Vaught's conjecture for o-minimal theories
- Vaught's conjecture for quite o-minimal theories
Cited in
(8)- A.D. Taimanov and model theory in Kazakhstan
- Discrete order on a definable set and the number of models
- A countable model for the theory of complete dense binary order
- The model \(N=\cup \{L[A]:\) A countable set of ordinals\(\}\)
- Types directed by constants
- Constructing many atomic models in \(\aleph_1\)
- On countably saturated linear orders and certain class of countably saturated graphs
- Non-existence of uniformly definable family of convex equivalence relations in an 1-type of small ordered theories and maximal number of models
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)
