Categoricity over P for first order T or categoricity for L__ 1 can stop at _ k while holding for _ 0, ,_k-1

From MaRDI portal

DOI10.1007/BF02807869zbMATH Open0723.03017arXivmath/9201240OpenAlexW1978825183MaRDI QIDQ757348FDOQ757348


Authors: S. Shelah, Bradd Hart Edit this on Wikidata


Publication date: 1990

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with infinite models. Following Hodges, we say that T is relatively lambda-categorical if whenever M, N models T, P(M)=P(N), |P(M)|= lambda then there is an isomorphism i:M-> N which is the identity on P(M). T is relatively categorical if it is relatively lambda-categorical for every lambda. The question arises whether the relative lambda-categoricity of T for some lambda >|T| implies that T is relatively categorical. In this paper, we provide an example, for every k>0, of a theory T_k and an L_{omega_1 omega} sentence varphi_k so that T_k is relatively aleph_n-categorical for n < k and varphi_k is aleph_n-categorical for n<k but T_k is not relatively beth_k-categorical and varphi_k is not beth_k-categorical.


Full work available at URL: https://arxiv.org/abs/math/9201240




Recommendations




Cites Work


Cited In (36)





This page was built for publication: Categoricity over P for first order T or categoricity for \(\phi\) \(\in {\mathcal L}_{\omega_ 1\omega}\) can stop at \(\aleph_ k\) while holding for \(\aleph_ 0,\dots ,\aleph_{k-1}\)

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