Journal of Symbolic Logic 67 (3):1169-1177 (2002)

Juliette Cara Kennedy
University of Helsinki
Assume $\langle \aleph_0, \aleph_1 \rangle \rightarrow \langle \lambda, \lambda^+ \rangle$ . Assume M is a model of a first order theory T of cardinality at most λ+ in a language L(T) of cardinality $\leq \lambda$ . Let N be a model with the same language. Let Δ be a set of first order formulas in L(T) and let D be a regular filter on λ. Then M is $\Delta-embeddable$ into the reduced power $N^\lambda/D$ , provided that every $\Delta-existential$ formula true in M is true also in N. We obtain the following corollary: for M as above and D a regular ultrafilter over $\lambda, M^\lambda/D$ is $\lambda^{++}-universal$ . Our second result is as follows: For $i < \mu$ let Mi and Ni be elementarily equivalent models of a language which has cardinality $\leq \lambda$ . Suppose D is a regular filter on λ and $\langle \aleph_0, \aleph_1 \rangle \rightarrow \langle \lambda, \lambda^+ \rangle$ holds. We show that then the second player has a winning strategy in the $Ehrenfeucht-Fra\ddot{i}ss\acute{e}$ game of length λ+ on $\prod_i M_i/D$ and $\prod_i N_i/D$ . This yields the following corollary: Assume GCH and λ regular (or just $\langle \aleph_0, \aleph_1 \rangle \rightarrow \langle \lambda, \lambda^+ \rangle$ and 2λ = λ+). For L, Mi and Ni be as above, if D is a regular filter on λ, then $\prod_i M_i/D \cong \prod_i N_i/D$
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1190150156
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,564
Through your library

References found in this work BETA

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
The Fine Structure of the Constructible Hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Onκ-Complete Reduced Products.Tapani Hyttinen - 1992 - Archive for Mathematical Logic 31 (3):193-199.

View all 6 references / Add more references

Citations of this work BETA

A Gap 1 Cardinal Transfer Theorem.Luis M. Villegas-Silva - 2006 - Mathematical Logic Quarterly 52 (4):340-350.
Regular Ultrapowers at Regular Cardinals.Juliette Kennedy, Saharon Shelah & Jouko Väänänen - 2015 - Notre Dame Journal of Formal Logic 56 (3):417-428.
Atomic Saturation of Reduced Powers.Saharon Shelah - forthcoming - Mathematical Logic Quarterly.

Add more citations

Similar books and articles

Stationary Sets and Infinitary Logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
Slim Models of Zermelo Set Theory.A. R. D. Mathias - 2001 - Journal of Symbolic Logic 66 (2):487-496.
A Weak Variation of Shelah's I[Ω₂].William J. Mitchell - 2004 - Journal of Symbolic Logic 69 (1):94-100.
On the T-Degrees of Partial Functions.Paolo Casalegno - 1985 - Journal of Symbolic Logic 50 (3):580-588.
A Gitik Iteration with Nearly Easton Factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
More on Regular Reduced Products.Juliette Cara Kennedy & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (4):1261 - 1266.


Added to PP index

Total views
24 ( #478,250 of 2,533,484 )

Recent downloads (6 months)
1 ( #391,480 of 2,533,484 )

How can I increase my downloads?


My notes