On Keisler singular‐like models

Mathematical Logic Quarterly 54 (3):330-336 (2008)
  Copy   BIBTEX

Abstract

Keisler in [7] proved that for a strong limit cardinal κ and a singular cardinal λ, the transfer relation κ → λ holds. We analyze the λ -like models produced in the proof of Keisler's transfer theorem when κ is further assumed to be regular. Our main result shows that with this extra assumption, Keisler's proof can be modified to produce a λ -like model M with built-in Skolem functions that satisfies the following two properties: M is generated by a subset C of order-type λ. M can be written as union of an elementary end extension chain 〈Ni: i < δ 〉 such that for each i < δ, there is an initial segment Ci of C with Ci ⊆ Ni, and Ni ∩ = ∅

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
On models with power-like ordering.Saharon Shelah - 1972 - Journal of Symbolic Logic 37 (2):247-267.
On the Splitting Number at Regular Cardinals.Omer Ben-Neria & Moti Gitik - 2015 - Journal of Symbolic Logic 80 (4):1348-1360.
The tree property and the failure of SCH at uncountable cofinality.Dima Sinapova - 2012 - Archive for Mathematical Logic 51 (5-6):553-562.
More on regular and decomposable ultrafilters in ZFC.Paolo Lipparini - 2010 - Mathematical Logic Quarterly 56 (4):340-374.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.

Analytics

Added to PP
2013-12-01

Downloads
20 (#1,038,527)

6 months
3 (#1,470,822)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Model theory of the inaccessibility scheme.Shahram Mohsenipour - 2011 - Archive for Mathematical Logic 50 (7-8):697-706.

Add more citations

References found in this work

The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
Generalizing special Aronszajn trees.James H. Schmerl - 1974 - Journal of Symbolic Logic 39 (4):732-740.

Add more references