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

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.

Review text

It is well-known that any countable first-order theory which is categorical in some uncountable power, is categorical in every such power. Several attempts were made to generalize this theorem to the case of non-classical logics as \({\mathcal L}_{\omega_ 1\omega}\), or some generalizations of the categoricity notion. One of those is relative categoricity. Let T be a complete first-order theory in a language containing the unary predicate P. T is relatively \(\lambda\)-categorical if whenever \({\mathfrak M}\), \({\mathfrak N}\) are models of T having identical relativisations to P of cardinality \(\lambda\), then there is an isomorphism of \({\mathfrak M}\) and \({\mathfrak N}\), being the identity on P. In the present paper the authors determine the limitation of the validity of the mentioned theorem: it does neither work for relative categoricity nor for the \({\mathcal L}_{\omega_ 1\omega}\) language. They give an example of a first-order theory T and an \({\mathcal L}_{\omega_ 1\omega}\) sentence \(\phi\) such that T is relatively \(\lambda\)-categorical and \(\phi\) is \(\lambda\)-categorical for \(\lambda =\aleph_ 0,...,\aleph_{k-1}\), but T is not relatively categorical and \(\phi\) is not categorical.

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)