# On regular reduced products

Journal of Symbolic Logic 67 (3):1169-1177 (2002)
Abstract
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
Options
 Save to my reading list Follow the author(s) My bibliography Export citation Find it on Scholar Edit this record Mark as duplicate Revision history Request removal from index

 PhilPapers Archive Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 21,527 External links Setup an account with your affiliations in order to access resources via your University's proxy server Configure custom proxy (use this if your affiliation does not provide a proxy) Through your library Sign in / register and configure your affiliation(s) to use this tool.Configure custom resolver
References found in this work BETA
Tapani Hyttinen (1992). Onκ-Complete Reduced Products. Archive for Mathematical Logic 31 (3):193-199.
Mroslav Benda (1972). On Reduced Products and Filters. Annals of Mathematical Logic 4 (1):1-29.
Citations of this work BETA

No citations found.

Similar books and articles

2009-01-28

3 ( #640,143 of 1,911,915 )