Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-rz424 Total loading time: 0.277 Render date: 2021-03-07T10:12:32.849Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

On regular reduced products*

Published online by Cambridge University Press:  12 March 2014

Juliette Kennedy
Affiliation:
Department of Mathematics, University of Helsinki, Helsinki, Finland, E-mail: juliette.kennedy@helsinki.fi
Saharon Shelah
Affiliation:
Institute of Mathematics, Hebrew University, Jerusalem, Israel, E-mail: shelah@math.huji.ac.il
Corresponding

Abstract

Assume (ℵ0, ℵ1) → (λ, λ+). Assume M is a model of a first order theory T of cardinality at most λ+ in a language of cardinality ≤ λ. Let N be a model with the same language. Let Δ be a set of first order formulas in and let D be a regular filter on λ. Then M is Δ-embeddable into the reduced power Nλ/D, provided that every Δ-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 λ, Mλ/D is λ++-universal. Our second result is as follows: For i < μ let Mi, and Ni, be elementarily equivalent models of a language which has cardinality ≤ λ. Suppose D is a regular filter on λ and (ℵ0, ℵ1) → (λ, λ+) holds. We show that then the second player has a winning strategy in the Ehrenfeucht-Fraïssé game of length λ+ on ΠiMi/D and ΠiNi/D. This yields the following corollary: Assume GCH and λ regular (or just (ℵ0, ℵ1) → (λ, λ+) and 2λ = λ+. For L, Mi and Ni be as above, if D is a regular filter on λ, then ΠiMi/D ≅ ΠiNi/D.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below.

Footnotes

*

This paper was written while the authors were guests of the Mittag-Leffler Institute, Djursholm, Sweden. The authors are grateful to the Institute for its support.

References

[1]Benda, M., On reduced products and filters, Ann. Math. Logic, vol. 4 (1972), pp. 129.CrossRefGoogle Scholar
[2]Chang, C. C., A note on the two cardinal problem, Proceedings of the American Mathematical Society, vol. 16 (1965), pp. 11481155.CrossRefGoogle Scholar
[3]Chang, C.C. and Keisler, J., Model theory, North-Holland.Google Scholar
[4]Hyttinen, T., On κ-complete reduced products, Archive for Mathematical Logic, vol. 31 (1992), no. 3, pp. 193199.CrossRefGoogle Scholar
[5]Jensen, R., The fine structure of the constructible hierarchy, with a section by Jack Silver, Ann. Math. Logic, vol. 4 (1972), pp. 229308.CrossRefGoogle Scholar
[6]Jónsson, B. and Olin, P., Almost direct products and saturation, Compositio Mathematica, vol. 20 (1968), pp. 125132.Google Scholar
[7]Keisler, J., Ultraproducts and saturated models, Koninkttjke Nederlandse Akademie van Weten-schappen. Proceedings. Ser. A 67 (=Indagationes Mathematicae 26), (1964), pp. 178186.Google Scholar
[8]Kennedy, J. and Shelah, S., On embedding models of arithmetic of cardinality ℵ1 into reduced powers, to appear.Google Scholar
[9]Mitchell, W., Aronszajn trees and the independence of the transfer property, Ann. Math. Logic, vol. 5 (1972/1973), pp. 2146.CrossRefGoogle Scholar
[10]Shelah, S., For what filters is every reduced product saturated?, Israel Journal of Mathematics, vol. 12 (1972), pp. 2331.CrossRefGoogle Scholar
[11]Shelah, S., “Gap I” two-cardinal principles and the omitting types theorem for L(Q), Israel Journal of Mathematics, vol. 65 (1989), no. 2, pp. 133152.CrossRefGoogle Scholar
[12]Shelah, S., Classification theory and the number of non-isomorphic models, second ed., North-Holland Publishing Co., Amsterdam, 1990.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 14 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 7th March 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On regular reduced products*
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

On regular reduced products*
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

On regular reduced products*
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *