On regular reduced products

Details On regular reduced products On regular reduced products

2001-05-16

arxiv.org/abs/math/0105135v1

Mathematics

Logic

Scientific paper

Assume ->. Assume M is a model of a first order theory T of cardinality at most lambda^+ in a vocabulary L(T) of cardinality <= lambda . Let N be a model with the same vocabulary. Let Delta be a set of first order formulas in L(T) and let D be a regular filter on lambda. 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-> holds. We show that then the second player has a winning strategy in the Ehrenfeucht-Fraisse game of length lambda^+ on prod_i M_i/D and prod_i N_i/D. This yields the following corollary: Assume GCH and lambda regular). For L, M_i and N_i as above, if D is a regular filter on lambda, then prod_i M_i/D cong prod_i N_i/D .

Affiliated with

Also associated with

No associations

Rating

On regular reduced products does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On regular reduced products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On regular reduced products will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-150999