Hostname: page-component-5db58dd55d-bthnr Total loading time: 0 Render date: 2026-06-10T16:17:04.240Z Has data issue: false hasContentIssue false

The number of pairwise non-elementarily-embeddable models

Published online by Cambridge University Press:  12 March 2014

Saharon Shelah*
Affiliation:
Institute of Mathematics, The Hebrew University, Jerusalem, Israel Department of Mathematics, Simon Fraser University, Burnaby, British Columbia B5A 1S6, Canada Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903

Abstract

We get consistency results on I(λ, T, T) under the assumption that D(T) has cardinality > ∣T∣. We get positive results and consistency results on IE(λ, T 1, T).

The interest is model-theoretic, but the content is mostly set-theoretic: in Theorems 1–3, combinatorial; in Theorems 4–7 and 11(2), to prove consistency of counterexamples we concentrate on forcing arguments; and in Theorems 8–10 and 11(1), combinatorics for counterexamples; the rest are discussion and problems. In particular:

(A) By Theorems 1 and 2, if TT 1 are first order countable, T complete stable but ℵ0-unstable, λ > ℵ0, and ∣D(T)∣ > ℵ0, then IE(λ, T 1, T) > Min{2λ , ℶ2}.

(B) By Theorems 4,5,6 of this paper, if e.g. V = L, then in some generic extension of V not collapsing cardinals, for some first order TT 1, ∣T∣ = ℵ0, ∣T 1∣ = ℵ1, ∣D(T)∣ = ℵ2 and IE(ℵ2, T1, T) = 1.

This paper (specifically the ZFC results) is continued in the very interesting work of Baldwin on diversity classes [Bl]. Some more advances can be found in the new version of [Sh300] (see Chapter III, mainly §7); they confirm 0.1, 0.2 and 14(1), 14(2).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1989

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable