Countable models of trivial theories which admit finite coding
The authors prove that a complete, countable, strictly stable, trivial first-order theory which admits finite coding has continuum many countable models. This extends a result of \textit{A. Pillay} [Arch. Math. Logic 31, 163-169 (1992; Zbl 0774.03019)] for the one-based case, and uses the \(U_\alpha\)-rank and dimension theory introduced by Pillay [\textit{B. Herwig, J. G. Loveys, A. Pillay, P. Tanović} and \textit{F. O. Wagner}, Arch. Math. Logic 31, 297-303 (1992; Zbl 0768.03014)]. The main tools used are (i) a Symmetry Lemma for dimension (Lemma 1), and (ii) a method of finding a strongly non-isolated finitely-based type (in sections 2 and 3); a many models argument essentially due to Shelah [\textit{S. Shelah, L. Harrington} and \textit{M. Makkai}, Isr. J. Math. 49, 269-280 (1984; Zbl 0584.03021)] then finishes the argument. A surprising consequence of the Symmetry Lemma is that every type of \(U_1\)-rank one is non-orthogonal to a superstable type. It should be possible to generalize this to higher dimensions. \{Reviewer's remark: Unfortunately, the paper contains many typographical errors and inaccuracies. In (c) read \(\bot^a\) for \(\bot^\alpha\). In (d) read stp\((B/AC)\) for stp\((A/BC)\). For stable theories one should define \(B\) to be almost atomic over \(A\) if for every finite \(\bar b\in B\) and every finite \(\bar a\in A\) there is \(\bar a'\in A\) extending \(\bar a\), such that tp\((\bar b/\bar a')\) is isolated. The results of the paper go through for this definition of almost atomic; for the definition as stated on page 1280, almost atomic models over countable sets in a small stable theory need not exist. In Definition 4 and in Lemma 4 read \(\bot^a\) for \(\not \bot^a\). The proof of Lemma 4 consists of only the first three lines. The rest forms an extra remark and its proof. On the top of page 1283, read stp\((a/bc)\) for stp\((a/c)\). At the end of proof of Proposition 1283, read \(\phi(x,b',c')\) for \(\psi(x,b',c')\). In proposition 3(i), read \(p\bot M_1\) for \(p\bot M_i\). On page 1285, line 19, read \(\bar b_i\triangleright\sim_{N_i}\bar a\bar b_i\) for \(\bar a\triangleright\sim_{N_i}\bar a\bar b_i\). On line 22 read tp\((A/N_1)\) for tp\((A/N_i)\) (or restrict to \(i\not= 0\)). On line -8, delete ``are satisfied.\}.
- 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
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)
