Forcing isomorphism II

DOI10.2307/2275818MaRDI QIDQ3128475zbMATH OpenOpenAlexFDO

Authors S. Shelah, M. C. Laskowski

Publication date 15 December 1997

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

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

zbMATH Keywords

c.c.c. forcingclassifiable theorycountable chain conditioninvariantsisomorphism type of a modelpotentially isomorphic modelssuperstable

Mathematics Subject Classification ID

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

Abstract: If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be forced isomorphic by a ccc forcing. We give examples showing that the hypothesis on the number of complete types is necessary and what happens if `ccc' is replaced other cardinal-preserving adjectives. We also give an example showing that membership in a pseudo-elementary class can be altered by very simple cardinal-preserving forcings.

Recommendations

• Forcing isomorphism
• On potential isomorphism and non-structure
• On the number of nonisomorphic models of size |T|
• scientific article; zbMATH DE number 3557787
• Classification theory and the number of non-isomorphic models.

Cites work

• Forcing isomorphism
• scientific article; zbMATH DE number 40985 (Why is no real title available?)
• scientific article; zbMATH DE number 3206556 (Why is no real title available?)

Cited in

(9)

• \({\mathcal M}\)-gap conjecture and \(m\)-normal theories
• On potential isomorphism and non-structure
• Characterizing an \(\aleph_\varepsilon\)-saturated model of superstable NDOP theories by its \(\mathbb{L}_{\infty, \aleph_\varepsilon}\)-theory
• Classification theory and 0^#
• Omitting types for stable ccc theories
• scientific article; zbMATH DE number 3557787 (Why is no real title available?)
• Forcing isomorphism
• Twins: non-isomorphic models forced to be isomorphic. I
• Constructions of many complicated uncountable structures and Boolean algebras

This page was built for publication: Forcing isomorphism II

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