Complete coinductive theories. I
HTML articles powered by AMS MathViewer
- by A. H. Lachlan PDF
- Trans. Amer. Math. Soc. 319 (1990), 209-241 Request permission
Abstract:
Let $T$ be a complete theory over a relational language which has an axiomatization by $\exists \forall$-sentences. The properties of models of $T$ are studied. It is shown that quantifier-free formulas are stable. This limited stability is used to show that in $\exists \forall$-saturated models the elementary types of tuples are determined by their $\exists$-types and algebraicity is determined by existential formulas. As an application, under the additional assumption that no quantifier-free formula has the FCP, the models $\mathcal {M}$ of $T$ are completely characterized in terms of certain $0$-definable equivalence relations on cartesian powers of $M$. This characterization yields a result similar to that of Schmerl for the case in which $T$ is ${\aleph _0}$-categorical.References
- J. Baldwin, Definable second-order quantifiers, Model-theoretic logics, Perspect. Math. Logic, Springer, New York, 1985, pp. 445–477. MR 819543
- John T. Baldwin and David W. Kueker, Ramsey quantifiers and the finite cover property, Pacific J. Math. 90 (1980), no. 1, 11–19. MR 599315
- J. T. Baldwin and S. Shelah, Second-order quantifiers and the complexity of theories, Notre Dame J. Formal Logic 26 (1985), no. 3, 229–303. MR 796638, DOI 10.1305/ndjfl/1093870870
- G. Cherlin and A. H. Lachlan, Stable finitely homogeneous structures, Trans. Amer. Math. Soc. 296 (1986), no. 2, 815–850. MR 846608, DOI 10.1090/S0002-9947-1986-0846608-8
- I. M. Hodkinson and H. D. Macpherson, Relational structures determined by their finite induced substructures, J. Symbolic Logic 53 (1988), no. 1, 222–230. MR 929387, DOI 10.2307/2274440 E. Hrushovski, Remarks on ${\aleph _0}$-stable ${\aleph _0}$-categorical theories, preprint.
- A. H. Lachlan, Complete theories with only universal and existential axioms, J. Symbolic Logic 52 (1987), no. 3, 698–711. MR 902985, DOI 10.2307/2274358
- A. H. Lachlan, Complete coinductive theories. II, Trans. Amer. Math. Soc. 328 (1991), no. 2, 527–562. MR 1014253, DOI 10.1090/S0002-9947-1991-1014253-1
- H. D. Macpherson, Graphs determined by their finite induced subgraphs, J. Combin. Theory Ser. B 41 (1986), no. 2, 230–234. MR 859313, DOI 10.1016/0095-8956(86)90046-8
- James H. Schmerl, Coinductive $\aleph _0$-categorical theories, J. Symbolic Logic 55 (1990), no. 3, 1130–1137. MR 1071319, DOI 10.2307/2274478
- Saharon Shelah, Classification theory and the number of nonisomorphic models, Studies in Logic and the Foundations of Mathematics, vol. 92, North-Holland Publishing Co., Amsterdam-New York, 1978. MR 513226
Additional Information
- © Copyright 1990 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 319 (1990), 209-241
- MSC: Primary 03C52; Secondary 03C45, 03C50, 03C65
- DOI: https://doi.org/10.1090/S0002-9947-1990-0957082-6
- MathSciNet review: 957082