Forcing isomorphism

DOI10.2307/2275144MaRDI QIDQ4283068zbMATH OpenOpenAlexFDO

Authors John T. Baldwin, S. Shelah, M. C. Laskowski

Publication date 14 March 1994

Published in Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

classifiable theoriespotentially isomorphic modelssuperstable

Mathematics Subject Classification ID

Model-theoretic forcing (03C25) Classification theory, stability, and related concepts in model theory (03C45)

Abstract: A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is classifiable if it is superstable and does not have either the dimensional order property or the omitting types order property. Shelah [Sh:c] showed that if a theory T is classifiable then each model of cardinality lambda is described by a sentence of L_{infty, lambda}. In fact this sentence can be chosen in the L^*_{lambda}. (L^*_{lambda} is the result of enriching the language L_{infty, beth^+} by adding for each mu < lambda a quantifier saying the dimension of a dependence structure is greater than mu .) The truth of such sentences will be preserved by any forcing that does not collapse cardinals <= lambda and that adds no new countable subsets of lambda. Hence, if two models of a classifiable theory of power lambda are non-isomorphic, they are non-isomorphic after a lambda-complete forcing. Here we show that the hypothesis of the forcing adding no new countable subsets of lambda cannot be eliminated. In particular, we show that non-isomorphism of models of a classifiable theory need not be preserved by ccc forcings.

Recommendations

• Forcing isomorphism II
• Isomorphism and classification for countable structures
• On potential isomorphism and non-structure
• Forcing a countable structure to belong to the ground model
• Potential isomorphism and semi-proper trees

Cites work

• Classification of first order theories which have a structure theorem
• scientific article; zbMATH DE number 3869258 (Why is no real title available?)

Cited in

(10)

• On potential isomorphism and non-structure
• Characterizing an \(\aleph_\varepsilon\)-saturated model of superstable NDOP theories by its \(\mathbb{L}_{\infty, \aleph_\varepsilon}\)-theory
• Can we resolve the continuum hypothesis?
• Forcing a countable structure to belong to the ground model
• Forcing isomorphism II
• Classification theory and 0^#
• The strength of the isomorphism property
• Potential isomorphism and semi-proper trees
• Computing strength of structures related to the field of real numbers
• Twins: non-isomorphic models forced to be isomorphic. I

This page was built for publication: Forcing isomorphism

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