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 ω ω + 1 (...) has a stationary initial segment.". (shrink)

We prove that in all Mitchell-Steel core models, □ κ holds for all κ. (See Theorem 2.). From this we obtain new consistency strength lower bounds for the failure of □ κ if κ is either singular and countably closed, weakly compact, or measurable. (Corallaries 5, 8, and 9.) Jensen introduced a large cardinal property that we call subcompactness; it lies between superstrength and supercompactness in the large cardinal hierarchy. We prove that in all Jensen core models, □ κ holds (...) iff κ is not subcompact. (See Theorem 15; the only if direction is essentially due to Jensen.). (shrink)

After reviewing various natural bi-interpretations in urelement set theory, including second-order set theories with urelements, we explore the strength of second-order reflection in these contexts. Ultimately, we prove, second-order reflection with the abundant atom axiom is bi-interpretable and hence also equiconsistent with the existence of a supercompact cardinal. The proof relies on a reflection characterization of supercompactness, namely, a cardinal κ is supercompact if and only if every Π11 sentence true in a structure M (of any size) containing κ in (...) a language of size less than κ is also true in a substructure m≺M of size less than κ with m∩κ∈κ. (shrink)

We present a survey of combinatorial set theory relevant to the study of singular cardinals and their successors. The topics covered include diamonds, squares, club guessing, forcing axioms, and PCF theory.

We present a general construction of a □κ-sequence in Jensen's fine structural extender models. This construction yields a local definition of a canonical □κ-sequence as well as a characterization of those cardinals κ, for which the principle □κ fails. Such cardinals are called subcompact and can be described in terms of elementary embeddings. Our construction is carried out abstractly, making use only of a few fine structural properties of levels of the model, such as solidity and condensation.

We ask, when is a property of a model a logical property? According to the so-called Tarski–Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics in which the model class is definable. This results in a graded concept of logicality in the terminology of Sagi [46]. We investigate which characteristics of logics, such as variants of the Löwenheim–Skolem theorem, Completeness theorem, and absoluteness, are relevant from the logicality (...) point of view, continuing earlier work by Bonnay, Feferman, and Sagi. We suggest that a logic is the more logical the closer it is to first order logic. We also offer a refinement of the result of McGee that logical properties of models can be expressed in $L_{\infty \infty }$ if the expression is allowed to depend on the cardinality of the model, based on replacing $L_{\infty \infty }$ by a “tamer” logic. (shrink)

The generic Vopěnka principle, we prove, is relatively consistent with the ordinals being non-Mahlo. Similarly, the generic Vopěnka scheme is relatively consistent with the ordinals being definably non-Mahlo. Indeed, the generic Vopěnka scheme is relatively consistent with the existence of a \-definable class containing no regular cardinals. In such a model, there can be no \-reflecting cardinals and hence also no remarkable cardinals. This latter fact answers negatively a question of Bagaria, Gitman and Schindler.

We show that the modal propositional logic G, originally introduced to describe the modality "it is provable that", is also sound for various interpretations using filters on ordinal numbers, for example the end-segment filters, the club filters, or the ineffable filters. We also prove that G is complete for the interpretation using end-segment filters. In the case of club filters, we show that G is complete if Jensen's principle □ κ holds for all $\kappa ; on the other hand, it (...) is consistent relative to a Mahlo cardinal that G be incomplete for the club filter interpretation. (shrink)

Abstract.This paper is the second in a series of three culminating in an ordinal analysis of Π12-comprehension. Its objective is to present an ordinal analysis for the subsystem of second order arithmetic with Δ12-comprehension, bar induction and Π12-comprehension for formulae without set parameters. Couched in terms of Kripke-Platek set theory, KP, the latter system corresponds to KPi augmented by the assertion that there exists a stable ordinal, where KPi is KP with an additional axiom stating that every set is contained (...) in an admissible set. (shrink)

§1. Introduction. The purpose of this paper is, in general, to report the state of the art of ordinal analysis and, in particular, the recent success in obtaining an ordinal analysis for the system of -analysis, which is the subsystem of formal second order arithmetic, Z2, with comprehension confined to -formulae. The same techniques can be used to provide ordinal analyses for theories that are reducible to iterated -comprehension, e.g., -comprehension. The details will be laid out in [28].Ordinal-theoretic proof theory (...) came into existence in 1936, springing forth from Gentzen's head in the course of his consistency proof of arithmetic. Gentzen fostered hopes that with sufficiently large constructive ordinals one could establish the consistency of analysis, i.e., Z2. Considerable progress has been made in proof theory since Gentzen's tragic death on August 4th, 1945, but an ordinal analysis of Z2 is still something to be sought. However, for reasons that cannot be explained here, -comprehension appears to be the main stumbling block on the road to understanding full comprehension, giving hope for an ordinal analysis of Z2 in the foreseeable future.Roughly speaking, ordinally informative proof theory attaches ordinals in a recursive representation system to proofs in a given formal system; transformations on proofs to certain canonical forms are then partially mirrored by operations on the associated ordinals. Among other things, ordinal analysis of a formal system serves to characterize its provably recursive ordinals, functions and functionals and can yield both conservation and combinatorial independence results. (shrink)

Combining techniques of the first author and Shelah with ideas of Magidor, we show how to get a model in which, for fixed but arbitrary finite n, the first n strongly compact cardinals κ 1 ,..., κ n are so that κ i for i = 1,..., n is both the i th measurable cardinal and κ + i supercompact. This generalizes an unpublished theorem of Magidor and answers a question of Apter and Shelah.

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V “ZFC + Ω is the least inaccessible limit of measurable limits of supercompact cardinals + ƒ : Ω → 2 is a function”, then there is a partial ordering P V so that for , There is a proper class of compact cardinals + If (...) ƒ = 0, then the αth compact cardinal is not supercompact + If ƒ = 1, then the αth compact cardinal is supercompact”. We then prove a generalized version of this theorem assuming κ is a supercompact limit of supercompact cardinals and ƒ : κ → 2 is a function, and we derive as corollaries of the generalized version of the theorem the consistency of the least measurable limit of supercompact cardinals being the same as the least measurable limit of nonsupercompact strongly compact cardinals and the consistency of the least supercompact cardinal being a limit of strongly compact cardinals. (shrink)

In this paper we introduce the Wholeness Axiom , which asserts that there is a nontrivial elementary embedding from V to itself. We formalize the axiom in the language {∈, j } , adding to the usual axioms of ZFC all instances of Separation, but no instance of Replacement, for j -formulas, as well as axioms that ensure that j is a nontrivial elementary embedding from the universe to itself. We show that WA has consistency strength strictly between I 3 (...) and the existence of a cardinal that is super- n -huge for every n . ZFC + WA is used as a background theory for studying generalizations of Laver sequences. We define the notion of Laver sequence for general classes E consisting of elementary embeddings of the form i :V β → M , where M is transitive, and use five globally defined large cardinal notions – strong, supercompact, extendible, super-almost-huge, superhuge – for examples and special cases of the main results. Assuming WA at the beginning, and eventually refining the hypothesis as far as possible, we prove the existence of a strong form of Laver sequence for a broad range of classes E that include the five large cardinal types mentioned. We show that if κ is globally superstrong, if E is Laver-closed at beth fixed points, and if there are superstrong embeddings i with critical point κ and arbitrarily large targets such that E is weakly compatible with i , then our standard constructions are E -Laver at κ . , there is an extendible Laver sequence at κ .) In addition, in most cases our Laver sequences can be made special if E is upward λ -closed for sufficiently many λ. (shrink)

The rank-into-rank and stronger large cardinal axioms assert the existence of certain elementary embeddings. By the preservation of the large cardinal properties of the embeddings under certain operations, strong implications between various of these axioms are derived.

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular μ of cofinality ℵ0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for some such μ there are $\mu^{++}$ graphs on μ+ that taken jointly are universal for the graphs on μ+, while $2^{\mu^+} \gg \mu^{++}$ . The paper also addresses the general problem of obtaining a framework for consistency results at the (...) successor of a singular strong limit starting from the assumption that a supercompact cardinal κ exists. The result on the existence of universal graphs is obtained as a specific application of a more general method. (shrink)

Versions of Laver sequences are known to exist for supercompact and strong cardinals. Assuming very strong axioms of infinity, Laver sequences can be constructed for virtually any globally defined large cardinal not weaker than a strong cardinal; indeed, under strong hypotheses, Laver sequences can be constructed for virtually any regular class of embeddings. We show here that if there is a regular class of embeddings with critical point κ, and there is an inaccessible above κ, then it is consistent for (...) there to be a regular class that admits no Laver sequence. We also show that extendible cardinals are Laver-generating, i.e., that assuming only that κ is extendible, there is an extendible Laver sequence at κ. We use the method of proof to answer a question about Laver-closure of extendible cardinals at inaccessibles. Finally, we consider Laver sequences for super-almost-huge cardinals. Assuming slightly more than super-almost-hugeness, we show that there are super-almost-huge Laver sequences, improving the previously known upper bound for such Laver sequences. We also describe conditions under which the canonical construction of a Laver sequence fails for super-almost-huge cardinals. (shrink)

I analyze the hierarchy of large cardinals between a supercompact cardinal and an almost-huge cardinal. Many of these cardinals are defined by modifying the definition of a high-jump cardinal. A high-jump cardinal is defined as the critical point of an elementary embedding j:V→M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${j: V \to M}$$\end{document} such that M is closed under sequences of length sup{j|f:κ→κ}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sup\{{j\,|\,f: \kappa \to \kappa}\}}$$\end{document}. Some of the other (...) cardinals analyzed include the super-high-jump cardinals, almost-high-jump cardinals, Shelah-for-supercompactness cardinals, Woodin-for-supercompactness cardinals, Vopěnka cardinals, hypercompact cardinals, and enhanced supercompact cardinals. I organize these cardinals in terms of consistency strength and implicational strength. I also analyze the superstrong cardinals, which are weaker than supercompact cardinals but are related to high-jump cardinals. Among the results, I highlight the following. Vopěnka cardinals are the same as Woodin-for-supercompactness cardinals.There are no excessively hypercompact cardinals.Furthermore, I prove some results relating high-jump cardinals to forcing, as well as analyzing Laver functions for super-high-jump cardinals. (shrink)

We show from an abstract comparison principle that the Mitchell order is linear on sufficiently strong ultrafilters: normal ultrafilters, Dodd solid ultrafilters, and assuming GCH, generalized normal ultrafilters. This gives a conditional answer to the well-known question of whether a [Formula: see text]-supercompact cardinal [Formula: see text] must carry more than one normal measure of order 0. Conditioned on a very plausible iteration hypothesis, the answer is no, since the Ultrapower Axiom holds in the canonical inner models at the finite (...) levels of supercompactness. (shrink)

We show that, assuming the consistency of a supercompact cardinal, the first inaccessible cardinal can satisfy a strong form of a Löwenheim–Skolem–Tarski theorem for the equicardinality logic L, a logic introduced in [5] strictly between first order logic and second order logic. On the other hand we show that in the light of present day inner model technology, nothing short of a supercompact cardinal suffices for this result. In particular, we show that the Löwenheim–Skolem–Tarski theorem for the equicardinality logic at (...) κ implies the Singular Cardinals Hypothesis above κ as well as Projective Determinacy. (shrink)

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 (...) such that κ is indestructibly supercompact and λ is measurable, then {δ < κ | δ is a measurable cardinal which is not a limit of measurable cardinals and δ satisfies level by level equivalence between strong compactness and supercompactness}must be unbounded in κ. The two aforementioned phenomena, however, need not occur in a universe with an indestructibly supercompact cardinal and sufficiently few large cardinals. In particular, we show how to construct a model with an indestructibly supercompact cardinal κ in which if δ < κ is a measurable cardinal which is not a limit of measurable cardinals, then δ must satisfy level by level equivalence between strong compactness and supercompactness. We also, however, show how to construct a model with an indestructibly supercompact cardinal κ in which if δ < κ is a measurable cardinal which is not a limit of measurable cardinals, then δ must violate level by level equivalence between strong compactness and supercompactness. (shrink)

We consider a weak version of Schindler’s remarkable cardinals that may fail to be ${{\rm{\Sigma }}_2}$-reflecting. We show that the ${{\rm{\Sigma }}_2}$-reflecting weakly remarkable cardinals are exactly the remarkable cardinals, and that the existence of a non-${{\rm{\Sigma }}_2}$-reflecting weakly remarkable cardinal has higher consistency strength: it is equiconsistent with the existence of an ω-Erdős cardinal. We give an application involving gVP, the generic Vopěnka principle defined by Bagaria, Gitman, and Schindler. Namely, we show that gVP + “Ord is not ${{\rm{\Delta (...) }}_2}$-Mahlo” and ${\text{gVP}}$ + “there is no proper class of remarkable cardinals” are both equiconsistent with the existence of a proper class of ω-Erdős cardinals, extending results of Bagaria, Gitman, Hamkins, and Schindler. (shrink)

We summarize the known methods of producing a non-supercompact strongly compact cardinal and describe some new variants. Our Main Theorem shows how to apply these methods to many cardinals simultaneously and exactly control which cardinals are supercompact and which are only strongly compact in a forcing extension. Depending upon the method, the surviving non-supercompact strongly compact cardinals can be strong cardinals, have trivial Mitchell rank or even contain a club disjoint from the set of measurable cardinals. These results improve and (...) unify Theorems 1 and 2 of [5], due to the first author. (shrink)

Vopěnka’s Principle is a natural large cardinal axiom that has recently found applications in category theory and algebraic topology. We show that Vopěnka’s Principle and Vopěnka cardinals are relatively consistent with a broad range of other principles known to be independent of standard (ZFC) set theory, such as the Generalised Continuum Hypothesis, and the existence of a definable well-order on the universe of all sets. We achieve this by showing that they are indestructible under a broad class of forcing constructions, (...) specifically, reverse Easton iterations of increasingly directed closed partial orders. (shrink)

We give a construction of the square principle by means of forcing with finite conditions.

Given a supercompact cardinal κ and a regular cardinal Λ < κ, we describe a type of forcing such that in the generic extension the cofinality of κ is Λ, there is a very good scale at κ, a bad scale at κ, and SCH at κ fails. When creating our model we have great freedom in assigning the value of 2κ, and so we can make SCH hold or fail arbitrarily badly.

It is shown in this paper that it is consistent (relative to almost huge cardinals) for various club guessing ideals to be saturated.

Given a regular cardinal λ and λ many supercompact cardinals, we describe a type of forcing such that in the generic extension there is a cardinal κ with cofinality λ, the Singular Cardinal Hypothesis at κ fails, and the tree property holds at κ+.

We construct two models containing exactly one supercompact cardinal in which all non-supercompact measurable cardinals are strictly taller than they are either strongly compact or supercompact. In the first of these models, level by level equivalence between strong compactness and supercompactness holds. In the other, level by level inequivalence between strong compactness and supercompactness holds. Each universe has only one strongly compact cardinal and contains relatively few large cardinals.

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 a (...) Mahlo cardinal in which the least supercompact cardinal κ is also the least strongly compact cardinal, κ 's strongness is indestructible under κ -strategically closed forcing, κ 's supercompactness is indestructible under κ -directed closed forcing not adding any new subsets of κ, and δ is Mahlo and reflects stationary sets iff δ is weakly compact. In this model, no strong cardinal δ < κ is indestructible under δ -strategically closed forcing. It therefore follows that it is relatively consistent for the least strong cardinal κ whose strongness is indestructible under κ -strategically closed forcing to be the same as the least supercompact cardinal, which also has its supercompactness indestructible under κ -directed closed forcing not adding any new subsets of κ. (shrink)

Using Steel's recent result that assuming AD, in L[R] below Θ, κ is regular $\operatorname{iff} \kappa$ is measurable, we mimic below Θ certain earlier results of Gitik. In particular, we construct via forcing a model in which all uncountable cardinals below Θ are singular and a model in which the only regular uncountable cardinal below Θ is ℵ 1.

We construct two models in which the least strongly compact cardinal κ is also the least strong cardinal. In each of these models, κ satisfies indestructibility properties for both its strong compactness and strongness.

We force and construct a model in which level by level equivalence between strong compactness and supercompactness holds, along with certain additional combinatorial properties. In particular, in this model, ♦ δ holds for every regular uncountable cardinal δ, and below the least supercompact cardinal κ, □ δ holds on a stationary subset of κ. There are no restrictions in our model on the structure of the class of supercompact cardinals.

We investigate the compatibility of $$I_0$$ with various combinatorial principles at $$\lambda ^+$$, which include the existence of $$\lambda ^+$$ -Aronszajn trees, square principles at $$\lambda $$, the existence of good scales at $$\lambda $$, stationary reflections for subsets of $$\lambda ^{+}$$, diamond principles at $$\lambda $$ and the singular cardinal hypothesis at $$\lambda $$. We also discuss whether these principles can hold in $$L(V_{\lambda +1})$$.

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 (...) under κ-directed closed forcing. (shrink)

Left distributive algebras arise in the study of classical structures such as groups, knots, and braids, as well as more exotic objects like large cardinals. A long-standing open question is whether the set of left divisors of every term in the free left distributive algebra on any number of generators is well-ordered. A conjecture of J. Moody describes a halting condition for descending sequences of left divisors in the free left distributive algebra on an arbitrary number of generators. In this (...) paper we present progress toward an affirmative answer to the open question mentioned above, namely we prove that the many generator form of Moody’s conjecture holds if each member of the free left distributive algebra has a “division form” representation in an expanded algebra. (shrink)

We construct a model for the level by level equivalence between strong compactness and supercompactness in which below the least supercompact cardinal κ, there is a stationary set of cardinals on which SCH fails. In this model, the structure of the class of supercompact cardinals can be arbitrary.

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 (...) is such that no cardinal δ > κ is measurable, κ’s supercompactness is indestructible under κ-directed closed, (κ +, ∞)-distributive forcing, and every measurable cardinal δ < κ is δ + strongly compact. The second of these contains a strong cardinal κ and is such that no cardinal δ > κ is measurable, κ’s strongness is indestructible under < κ-strategically closed, (κ +, ∞)-distributive forcing, and level by level inequivalence between strong compactness and supercompactness holds. The model from the first of our forcing constructions is used to show that it is consistent, relative to a supercompact cardinal, for the least cardinal κ which is both strong and has its strongness indestructible under κ-directed closed, (κ +, ∞)-distributive forcing to be the same as the least supercompact cardinal, which has its supercompactness indestructible under κ-directed closed, (κ +, ∞)-distributive forcing. It further follows as a corollary of the first of our forcing constructions that it is possible to build a model containing a supercompact cardinal κ in which no cardinal δ > κ is measurable, κ is indestructibly supercompact, and every measurable cardinal δ < κ which is not a limit of measurable cardinals is δ + strongly compact. (shrink)