Results for 'nonreflecting stationary set of ordinals'

959 found
Order:
  1.  40
    Failure of GCH and the level by level equivalence between strong compactness and supercompactness.Arthur W. Apter - 2003 - Mathematical Logic Quarterly 49 (6):587.
    We force and obtain three models in which level by level equivalence between strong compactness and supercompactness holds and in which, below the least supercompact cardinal, GCH fails unboundedly often. In two of these models, GCH fails on a set having measure 1 with respect to certain canonical measures. There are no restrictions in all of our models on the structure of the class of supercompact cardinals.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  46
    Indestructibility, measurability, and degrees of supercompactness.Arthur W. Apter - 2012 - Mathematical Logic Quarterly 58 (1):75-82.
    Suppose that κ is indestructibly supercompact and there is a measurable cardinal λ > κ. It then follows that A1 = {δ < κ∣δ is measurable, δ is not a limit of measurable cardinals, and δ is not δ+ supercompact} is unbounded in κ. If in addition λ is 2λ supercompact, then A2 = {δ < κ∣δ is measurable, δ is not a limit of measurable cardinals, and δ is δ+ supercompact} is unbounded in κ as well. The large cardinal (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  27
    Splitting stationary sets from weak forms of Choice.Paul Larson & Saharon Shelah - 2009 - Mathematical Logic Quarterly 55 (3):299-306.
    Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below λ of cofinality θ into λ many stationary sets, where θ < λ are regular cardinals. This is a continuation of [4].
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  37
    The stationary set splitting game.Paul B. Larson & Saharon Shelah - 2008 - Mathematical Logic Quarterly 54 (2):187-193.
    The stationary set splitting game is a game of perfect information of length ω1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinals and split tries to continuously divide them into two stationary pieces. We show that it is possible in ZFC to force a winning strategy for either player, or for neither. This gives a new counterexample to Σ22 maximality with a predicate for the nonstationary ideal on ω1, and an example (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  5. Full reflection of stationary sets below ℵω.Thomas Jech & Saharon Shelah - 1990 - Journal of Symbolic Logic 55 (2):822 - 830.
    It is consistent that, for every n ≥ 2, every stationary subset of ω n consisting of ordinals of cofinality ω k, where k = 0 or k ≤ n - 3, reflects fully in the set of ordinals of cofinality ω n - 1. We also show that this result is best possible.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  6.  77
    Reflecting stationary sets.Menachem Magidor - 1982 - Journal of Symbolic Logic 47 (4):755-771.
    We prove that the statement "For every pair A, B, stationary subsets of ω 2 , composed of points of cofinality ω, there exists an ordinal α such that both A ∩ α and $B \bigcap \alpha$ are stationary subsets of α" is equiconsistent with the existence of weakly compact cardinal. (This completes results of Baumgartner and Harrington and Shelah.) We also prove, assuming the existence of infinitely many supercompact cardinals, the statement "Every stationary subset of ω (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  7.  60
    On splitting stationary subsets of large cardinals.James E. Baumgartner, Alan D. Taylor & Stanley Wagon - 1977 - Journal of Symbolic Logic 42 (2):203-214.
    Let κ denote a regular uncountable cardinal and NS the normal ideal of nonstationary subsets of κ. Our results concern the well-known open question whether NS fails to be κ + -saturated, i.e., are there κ + stationary subsets of κ with pairwise intersections nonstationary? Our first observation is: Theorem. NS is κ + -saturated iff for every normal ideal J on κ there is a stationary set $A \subseteq \kappa$ such that $J = NS \mid A = (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  8.  38
    Forcing with adequate sets of models as side conditions.John Krueger - 2017 - Mathematical Logic Quarterly 63 (1-2):124-149.
    We present a general framework for forcing on ω2 with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial segment. We give several examples of this type of forcing, including adding a function on ω2, adding a nonreflecting stationary subset of, and adding an ω1‐Kurepa tree.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  9.  47
    Indestructibility and stationary reflection.Arthur W. Apter - 2009 - Mathematical Logic Quarterly 55 (3):228-236.
    If κ < λ are such that κ is a strong cardinal whose strongness is indestructible under κ -strategically closed forcing and λ is weakly compact, then we show thatA = {δ < κ | δ is a non-weakly compact Mahlo cardinal which reflects stationary sets}must be unbounded in κ. This phenomenon, however, need not occur in a universe with relatively few large cardinals. In particular, we show how to construct a model where no cardinal is supercompact up to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10.  60
    Destructibility of stationary subsets of Pκλ.Sakaé Fuchino & Greg Piper - 2005 - Mathematical Logic Quarterly 51 (6):560-569.
    For a regular cardinal κ with κ<κ = κ and κ ≤ λ , we construct generically a subset S of {x ∈ Pκλ : x ∩ κ is a singular ordinal} such that S is stationary in a strong sense but the stationarity of S can be destroyed by a κ+-c. c. forcing ℙ* which does not add any new element of Pκλ . Actually ℙ* can be chosen so that ℙ* is κ-strategically closed. However we show that (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  36
    Separating diagonal stationary reflection principles.Gunter Fuchs & Chris Lambie-Hanson - 2021 - Journal of Symbolic Logic 86 (1):262-292.
    We introduce three families of diagonal reflection principles for matrices of stationary sets of ordinals. We analyze both their relationships among themselves and their relationships with other known principles of simultaneous stationary reflection, the strong reflection principle, and the existence of square sequences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  30
    Semimorasses and nonreflection at singular cardinals.Piotr Koszmider - 1995 - Annals of Pure and Applied Logic 72 (1):1-23.
    Some subfamilies of κ, for κ regular, κ λ, called -semimorasses are investigated. For λ = κ+, they constitute weak versions of Velleman's simplified -morasses, and for λ > κ+, they provide a combinatorial framework which in some cases has similar applications to the application of -morasses with this difference that the obtained objects are of size λ κ+, and not only of size κ+ as in the case of morasses. New consistency results involve existence of nonreflecting objects of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  40
    Stationary logic of ordinals.Alan H. Mekler - 1984 - Annals of Pure and Applied Logic 26 (1):47-68.
  14.  19
    Adding a Nonreflecting Weakly Compact Set.Brent Cody - 2019 - Notre Dame Journal of Formal Logic 60 (3):503-521.
    For n<ω, we say that theΠn1-reflection principle holds at κ and write Refln if and only if κ is a Πn1-indescribable cardinal and every Πn1-indescribable subset of κ has a Πn1-indescribable proper initial segment. The Πn1-reflection principle Refln generalizes a certain stationary reflection principle and implies that κ is Πn1-indescribable of order ω. We define a forcing which shows that the converse of this implication can be false in the case n=1; that is, we show that κ being Π11-indescribable (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  17
    Capturing sets of ordinals by normal ultrapowers.Miha E. Habič & Radek Honzík - 2023 - Annals of Pure and Applied Logic 174 (6):103261.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  59
    The size of $\tilde{T}$.Paul Larson - 2000 - Archive for Mathematical Logic 39 (7):541-568.
    Given a stationary subset T of $\omega_{1}$ , let $\tilde{T}$ be the set of ordinals in the interval $(\omega_{1}, \omega_{2})$ which are necessarily in the image of T by any embedding derived from the nonstationary ideal. We consider the question of the size of $\tilde{T}$ , givenT, and use Martin's Maximum and $\mathbb{P}_{max}$ to give some answers.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  17.  31
    The Eightfold Way.James Cummings, Sy-David Friedman, Menachem Magidor, Assaf Rinot & Dima Sinapova - 2018 - Journal of Symbolic Logic 83 (1):349-371.
    Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing that any of their eight Boolean combinations can be forced to hold at${\kappa ^{ + + }}$, assuming that$\kappa = {\kappa ^{ < \kappa }}$and there is a weakly compact cardinal aboveκ.If in additionκis supercompact then we can forceκto be${\aleph _\omega }$in the extension. The proofs combine the techniques of adding and then (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  18.  26
    Coding lemmata in L.George Kafkoulis - 2004 - Archive for Mathematical Logic 43 (2):193-213.
    Under the assumption that there exists an elementary embedding (henceforth abbreviated as and in particular under we prove a Coding Lemma for and find certain versions of it which are equivalent to strong regularity of cardinals below . We also prove that a stronger version of the Coding Lemma holds for a stationary set of ordinals below.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  19.  27
    Level by level equivalence and strong compactness.Arthur W. Apter - 2004 - Mathematical Logic Quarterly 50 (1):51.
    We force and construct models in which there are non-supercompact strongly compact cardinals which aren't measurable limits of strongly compact cardinals and in which level by level equivalence between strong compactness and supercompactness holds non-trivially except at strongly compact cardinals. In these models, every measurable cardinal κ which isn't either strongly compact or a witness to a certain phenomenon first discovered by Menas is such that for every regular cardinal λ > κ, κ is λ strongly compact iff κ is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  39
    Reflecting stationary sets and successors of singular cardinals.Saharon Shelah - 1991 - Archive for Mathematical Logic 31 (1):25-53.
    REF is the statement that every stationary subset of a cardinal reflects, unless it fails to do so for a trivial reason. The main theorem, presented in Sect. 0, is that under suitable assumptions it is consistent that REF and there is a κ which is κ+n -supercompact. The main concepts defined in Sect. 1 are PT, which is a certain statement about the existence of transversals, and the “bad” stationary set. It is shown that supercompactness (and even (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   41 citations  
  21.  36
    Higher indescribability and derived topologies.Brent Cody - 2023 - Journal of Mathematical Logic 24 (1).
    We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection principle leads to the definitions of [Formula: see text]-indescribability and [Formula: see text]-indescribability of a cardinal [Formula: see text] for all [Formula: see text]. In this context, universal [Formula: see text] formulas exist, there is a normal ideal associated to [Formula: see text]-indescribability and the notions of [Formula: (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  68
    Indestructibility, instances of strong compactness, and level by level inequivalence.Arthur W. Apter - 2010 - Archive for Mathematical Logic 49 (7-8):725-741.
    Suppose λ > κ is measurable. We show that if κ is either indestructibly supercompact or indestructibly strong, then A = {δ < κ | δ is measurable, yet δ is neither δ + strongly compact nor a limit of measurable cardinals} must be unbounded in κ. The large cardinal hypothesis on λ is necessary, as we further demonstrate by constructing via forcing two models in which ${A = \emptyset}$ . The first of these contains a supercompact cardinal κ and (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  23.  67
    Representability of Ordinal Relations on a Set of Conditional Events.Giulianella Coletti & Barbara Vantaggi - 2006 - Theory and Decision 60 (2-3):137-174.
    Any dynamic decision model should be based on conditional objects and must refer to (not necessarily structured) domains containing only the elements and the information of interest. We characterize binary relations, defined on an arbitrary set of conditional events, which are representable by a coherent generalized decomposable conditional measure and we study, in particular, the case of binary relations representable by a coherent conditional probability.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  45
    Partitioning pairs of countable sets of ordinals.Dan Velleman - 1990 - Journal of Symbolic Logic 55 (3):1019-1021.
  25.  32
    Guessing and non-guessing of canonical functions.David Asperó - 2007 - Annals of Pure and Applied Logic 146 (2):150-179.
    It is possible to control to a large extent, via semiproper forcing, the parameters measuring the guessing density of the members of any given antichain of stationary subsets of ω1 . Here, given a pair of ordinals, we will say that a stationary set Sω1 has guessing density if β0=γ and , where γ is, for every stationary S*ω1, the infimum of the set of ordinals τ≤ω1+1 for which there is a function with ot)<τ for (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  22
    Dimensions of Ordinals: Set Theory, Homology Theory, and the First Omega Alephs.Jeffrey Bergfalk - 2021 - Bulletin of Symbolic Logic 27 (4):526-527.
    We describe an organizing framework for the study of infinitary combinatorics. This framework is Čech cohomology. It describes ZFC principles distinguishing among the ordinals of the form $\omega _n$. More precisely, this framework correlates each $\omega _n$ with an $$ -dimensional generalization of Todorcevic’s walks technique, and begins to account for that technique’s “unreasonable effectiveness” on $\omega _1$.We show in contrast that on higher cardinals $\kappa $, the existence of these principles is frequently independent of the ZFC axioms. Finally, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27.  60
    Representation of Ordinal Numbers and Derived Sets in Certain Continuous Sets.Frederick Bagemihl - 1981 - Mathematical Logic Quarterly 27 (19-21):333-336.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  63
    Supercompactness and level by level equivalence are compatible with indestructibility for strong compactness.Arthur W. Apter - 2007 - Archive for Mathematical Logic 46 (3-4):155-163.
    It is known that if $\kappa < \lambda$ are such that κ is indestructibly supercompact and λ is 2λ supercompact, then level by level equivalence between strong compactness and supercompactness fails. We prove a theorem which points towards this result being best possible. Specifically, we show that relative to the existence of a supercompact cardinal, there is a model for level by level equivalence between strong compactness and supercompactness containing a supercompact cardinal κ in which κ’s strong compactness is indestructible (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  29.  38
    Some remarks on indestructibility and Hamkins? lottery preparation.Arthur W. Apter - 2003 - Archive for Mathematical Logic 42 (8):717-735.
    .In this paper, we first prove several general theorems about strongness, supercompactness, and indestructibility, along the way giving some new applications of Hamkins’ lottery preparation forcing to indestructibility. We then show that it is consistent, relative to the existence of cardinals κ<λ so that κ is λ supercompact and λ is inaccessible, for the least strongly compact cardinal κ to be the least strong cardinal and to have its strongness, but not its strong compactness, indestructible under κ-strategically closed forcing.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  30.  40
    Exact upper bounds and their uses in set theory.Menachem Kojman - 1998 - Annals of Pure and Applied Logic 92 (3):267-282.
    The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem gives a necessary and sufficient condition for the existence of an exact upper bound ƒ for a ¦A¦+ is regular: an eub ƒ with lim infI cf ƒ = μ exists if and only if for every regular κ ε the set of flat points in tf of cofinality κ is stationary. Two applications of the main Theorem to set (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  28
    Characterizing strong compactness via strongness.Arthur W. Apter - 2003 - Mathematical Logic Quarterly 49 (4):375.
    We construct a model in which the strongly compact cardinals can be non-trivially characterized via the statement “κ is strongly compact iff κ is a measurable limit of strong cardinals”. If our ground model contains large enough cardinals, there will be supercompact cardinals in the universe containing this characterization of the strongly compact cardinals.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32.  27
    The Diagonal Strong Reflection Principle and its Fragments.C. O. X. Sean D. & Gunter Fuchs - 2023 - Journal of Symbolic Logic 88 (3):1281-1309.
    A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated with arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the corresponding forcing axioms and the corresponding fragments of the strong reflection principle, are analyzed, and consequences are presented. Some of these consequences are “exact” versions of diagonal stationary reflection principles of sets of ordinals. We also separate some of these diagonal strong reflection principles from related (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33.  68
    Level by level inequivalence beyond measurability.Arthur W. Apter - 2011 - Archive for Mathematical Logic 50 (7-8):707-712.
    We construct models containing exactly one supercompact cardinal in which level by level inequivalence between strong compactness and supercompactness holds. In each model, above the supercompact cardinal, there are finitely many strongly compact cardinals, and the strongly compact and measurable cardinals precisely coincide.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  34.  26
    Stationary sets added when forcing squares.Maxwell Levine - 2018 - Archive for Mathematical Logic 57 (7-8):909-916.
    Current research in set theory raises the possibility that \ can be made compatible with some stationary reflection, depending on the parameter \. The purpose of this paper is to demonstrate the difficulty in such results. We prove that the poset \\), which adds a \-sequence by initial segments, will also add non-reflecting stationary sets concentrating in any given cofinality below \. We also investigate the CMB poset, which adds \ in a slightly different way. We prove that (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  82
    Possible behaviours of the reflection ordering of stationary sets.Jiří Witzany - 1995 - Journal of Symbolic Logic 60 (2):534-547.
    If S, T are stationary subsets of a regular uncountable cardinal κ, we say that S reflects fully in $T, S , if for almost all α ∈ T (except a nonstationary set) S ∩ α is stationary in α. This relation is known to be a well-founded partial ordering. We say that a given poset P is realized by the reflection ordering if there is a maximal antichain $\langle X_p; p \in P\rangle$ of stationary subsets of (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  36.  38
    Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
    We give upper and lower bounds for the strength of ordinal definable determinacy in a small admissible set. The upper bound is roughly a premouse with a measurable cardinal $\kappa$ of Mitchell order $\kappa^{++}$ and $\omega$ successors. The lower bound are models of ZFC with sequences of measurable cardinals, extending the work of Lewis, below a regular limit of measurable cardinals.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  37.  78
    Indestructibility and level by level equivalence and inequivalence.Arthur W. Apter - 2007 - Mathematical Logic Quarterly 53 (1):78-85.
    If κ < λ are such that κ is indestructibly supercompact and λ is 2λ supercompact, it is known from [4] that {δ < κ | δ is a measurable cardinal which is not a limit of measurable cardinals and δ violates level by level equivalence between strong compactness and supercompactness}must be unbounded in κ. On the other hand, using a variant of the argument used to establish this fact, it is possible to prove that if κ < λ are (...)
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  38.  73
    The model N = ∪ {L[A]: A countable set of ordinals}.Claude Sureson - 1987 - Annals of Pure and Applied Logic 36:289-313.
    This paper continues the study of covering properties of models closed under countable sequences. In a previous article we focused on C. Chang's Model . Our purpose is now to deal with the model N = ∪ { L [A]: A countable ⊂ Ord}. We study here relations between covering properties, satisfaction of ZF by N , and cardinality of power sets. Under large cardinal assumptions N is strictly included in Chang's Model C , it may thus be interesting to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  36
    The consistency strength of hyperstationarity.Joan Bagaria, Menachem Magidor & Salvador Mancilla - 2019 - Journal of Mathematical Logic 20 (1):2050004.
    We introduce the large-cardinal notions of ξ-greatly-Mahlo and ξ-reflection cardinals and prove (1) in the constructible universe, L, the first ξ-reflection cardinal, for ξ a successor ordinal, is strictly between the first ξ-greatly-Mahlo and the first Π1ξ-indescribable cardinals, (2) assuming the existence of a ξ-reflection cardinal κ in L, ξ a successor ordinal, there exists a forcing notion in L that preserves cardinals and forces that κ is (ξ+1)-stationary, which implies that the consistency strength of the existence of a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  40.  33
    Reflection of stationary sets and the tree property at the successor of a singular cardinal.Laura Fontanella & Menachem Magidor - 2017 - Journal of Symbolic Logic 82 (1):272-291.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  75
    Ladder Gaps over Stationary Sets.Uri Abraham & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (2):518 - 532.
    For a stationary set $S \subseteq \omega_{1}$ and a ladder system C over S, a new type of gaps called C-Hausdorff is introduced and investigated. We describe a forcing model of ZFC in which, for some stationary set S, for every ladder C over S, every gap contains a subgap that is C-Hausdorff. But for every ladder E over \omega_{1} \ S$ there exists a gap with no subgap that is E-Hausdorff. A new type of chain condition, called (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  42.  33
    Indestructible strong compactness and level by level inequivalence.Arthur W. Apter - 2013 - Mathematical Logic Quarterly 59 (4-5):371-377.
    If are such that δ is indestructibly supercompact and γ is measurable, then it must be the case that level by level inequivalence between strong compactness and supercompactness fails. We prove a theorem which points to this result being best possible. Specifically, we show that relative to the existence of cardinals such that κ1 is λ‐supercompact and λ is inaccessible, there is a model for level by level inequivalence between strong compactness and supercompactness containing a supercompact cardinal in which κ’s (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  64
    Splitting stationary sets in.Toshimichi Usuba - 2012 - Journal of Symbolic Logic 77 (1):49-62.
    Let A be a non-empty set. A set $S\subseteq \mathcal{P}(A)$ is said to be stationary in $\mathcal{P}(A)$ if for every f: [A] <ω → A there exists x ∈ S such that x ≠ A and f"[x] <ω ⊆ x. In this paper we prove the following: For an uncountable cardinal λ and a stationary set S in \mathcal{P}(\lambda) , if there is a regular uncountable cardinal κ ≤ λ such that {x ∈ S: x ⋂ κ ∈ (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  70
    Identity crises and strong compactness III: Woodin cardinals. [REVIEW]Arthur W. Apter & Grigor Sargsyan - 2006 - Archive for Mathematical Logic 45 (3):307-322.
    We show that it is consistent, relative to n ∈ ω supercompact cardinals, for the strongly compact and measurable Woodin cardinals to coincide precisely. In particular, it is consistent for the first n strongly compact cardinals to be the first n measurable Woodin cardinals, with no cardinal above the n th strongly compact cardinal being measurable. In addition, we show that it is consistent, relative to a proper class of supercompact cardinals, for the strongly compact cardinals and the cardinals which (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  45.  16
    Characterizations of Ordinal Numbers in Set Theory.S. A. Cook & Hao Wang - 1968 - Journal of Symbolic Logic 33 (1):113-113.
  46.  41
    Menachem Magidor. Representing sets of ordinals as countable unions of sets in the core model. Transactions of the American Mathematical Society, vol. 317 , pp. 91–126. [REVIEW]Philip Welch - 1995 - Journal of Symbolic Logic 60 (2):701-704.
  47.  42
    Order types of ordinals in models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
    An ordinal in a model of set theory is truly countable if its set of predecessors is countable in the real world. We classify the order types of the sets of truly countable ordinals. Models with indiscernibles and other related results are discussed.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  41
    Stacks not fuzzy sets: An ordinal basis for prototype theory of concepts.Gregory V. Jones - 1982 - Cognition 12 (3):281-290.
  49.  68
    κ-stationary subsets of.Natasha Dobrinen - 2008 - Journal of Symbolic Logic 73 (1):238-260.
    We characterize the -distributive law in Boolean algebras in terms of cut and choose games.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  16
    Two-Cardinal Derived Topologies, Indescribability and Ramseyness.Brent Cody, Chris Lambie-Hanson & Jing Zhang - forthcoming - Journal of Symbolic Logic:1-29.
    We introduce a natural two-cardinal version of Bagaria’s sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points of sets can be characterized in terms of a new iterated form of pairwise simultaneous reflection of certain kinds of stationary sets, the first few instances of which are often equivalent to notions related to strong stationarity, which has been studied previously in the context of strongly normal ideals. The non-discreteness of these (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 959