Journal of Symbolic Logic 61 (1):293-312 (1996)
|Abstract||We follow  in asking when a set of ordinals $X \subseteq \alpha$ is a countable union of sets in K, the core model. We show that, analogously to L, and X closed under the canonical Σ 1 Skolem function for K α can be so decomposed provided K is such that no ω-closed filters are put on its measure sequence, but not otherwise. This proviso holds if there is no inner model of a weak Erdős-type property|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Thomas Jech (1982). On Hereditarily Countable Sets. Journal of Symbolic Logic 47 (1):43-47.
Timothy Bays (2009). Skolem's Paradox. In Edward N. Zalta (ed.), Stanford Encyclopedia of Philosophy.
William J. Mitchell (1998). The Complexity of the Core Model. Journal of Symbolic Logic 63 (4):1393-1398.
John E. Hutchinson (1976). Order Types of Ordinals in Models of Set Theory. Journal of Symbolic Logic 41 (2):489-502.
Andreas Blass (1981). The Model of Set Theory Generated by Countably Many Generic Reals. Journal of Symbolic Logic 46 (4):732-752.
Boško Živaljević (1991). U-Meager Sets When the Cofinality and the Coinitiality of U Are Uncountable. Journal of Symbolic Logic 56 (3):906-914.
Saharon Shelah (1978). End Extensions and Numbers of Countable Models. Journal of Symbolic Logic 43 (3):550-562.
H. R. Strong (1970). Construction of Models for Algebraically Generalized Recursive Function Theory. Journal of Symbolic Logic 35 (3):401-409.
Friederike Körner (1998). Automorphisms Moving All Non-Algebraic Points and an Application to NF. Journal of Symbolic Logic 63 (3):815-830.
Philip Welch (1987). The Reals in Core Models. Journal of Symbolic Logic 52 (1):64-67.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?