We construct models for the level-by-level equivalence between strong compactness and supercompactness containing failures of the Generalized Continuum Hypothesis at inaccessible cardinals. In one of these models, no cardinal is supercompact up to an inaccessible cardinal, and for every inaccessible cardinal $\delta $, $2^{\delta }\gt \delta ^{++}$. In another of these models, no cardinal is supercompact up to an inaccessible cardinal, and the only inaccessible cardinals at which GCH holds are (...) also measurable. These results extend and generalize earlier work of the author. (shrink)

We show that a coding principle introduced by J. Moore with respect to all ladder systems is equiconsistent with the existence of a strongly inaccessible cardinal. We also show that a coding principle introduced by S. Todorcevic has consistency strength at least of a strongly inaccessible cardinal.

In this paper I prove the following theorems which are the converses of some results of Judah and Laver (1983) and of Judah and Marshall (1993).-IfKM+ATW is not an extension by definition ofKM (and the model involved is well founded), then the existence of two inaccessible cardinals is consistent with ZF.-IfKM+ATW is not a conservative extension ofKM (and the model involved is well founded), then the existence of an inaccessible number of inaccessible cardinals is consistent with ZF.whereKM (...) is Kelley Morse theory andKM+ATW isKM with types of well-orders. (shrink)

Les trois dialogues composés par le cardinal Nicolas de Cues pendant l'été 1450 ne résument pas toute la pensée de cet auteur, mais ils éclairent d'un jour relativement nouveau sa réflexion sur le lien entre sagesse et savoir. Proche en cela des Anciens, Nicolas de Cues pense leur unité dans la lumière de l'Un - de la Déité, écrit-il parfois - réfléchie par la puissance de l'esprit humain. Cet esprit est compris comme imago dei, non pas image de Dieu, (...) car tout ce qui est image de Dieu, mais plutôt copie de Dieu, reprise de la toute-puissance divine dans les limites que lui impose, toutefois, le fait d'être finie. La vérité étant en elle-même inaccessible ici-bas - inattingible, écrit Nicolas de Cues - reste le développement de cette vérité ou de l'Un, c'est à dire ce monde que l'esprit a pour tâche de mesurer, de reprendre, de recréer. Savoir pour inventer un monde à venir, avec humilité et ouverture à l'Etranger : cela s'accorde précisément avec ce que certains historiens nomment l'Humanisme. (shrink)

The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κth level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of this paper is to show that the consistency strength of inaccessible set axioms (...) heavily depend on the context in which they are embedded. The context here will be the theory CZF− of constructive Zermelo–Fraenkel set theory but without -Induction . Let INAC be the statement that for every set there is an inaccessible set containing it. CZF−+INAC is a mathematically rich theory in which one can easily formalize Bishop style constructive mathematics and a great deal of category theory. CZF−+INAC also has a realizability interpretation in type theory which gives its theorems a direct computational meaning. The main result presented here is that the proof theoretic ordinal of CZF−+INAC is a small ordinal known as the Feferman–Schütte ordinal Γ0. (shrink)

This paper introduces the theme of killing‐them‐softly between set‐theoretic universes. The main theorems show how to force to reduce the large cardinal strength of a cardinal to a specified desired degree. The killing‐them‐softly theme is about both forcing and the gradations in large cardinal strength. Thus, I also develop meta‐ordinal extensions of the hyper‐inaccessible and hyper‐Mahlo degrees. This paper extends the work of Mahlo to create new large cardinals and also follows the larger theme of exploring (...) interactions between large cardinals and forcing central to modern set theory. (shrink)

Suppose L = { <,...} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a κ-like model where κ is an inaccessible cardinal. Such T proves the Inaccessibility Scheme. In this paper we study elementary end extensions of models of the inaccessibility scheme.

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa$. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC where for every $n\geq 2$ and $\mu\geq \aleph_n$, we have $(\aleph_n, \mu)$-ITP.

An inaccessible cardinal κ is supercompact when (κ, λ)-ITP holds for all λ ≥ κ. We prove that if there is a model of ZFC with two supercompact cardinals, then there is a model of ZFC where simultaneously \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(\aleph_2, \mu)}$$\end{document} -ITP and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(\aleph_3, \mu')}$$\end{document} -ITP hold, for all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mu\geq \aleph_2}$$\end{document} and \documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mu'\geq \aleph_3}$$\end{document}. (shrink)

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals κ with the property that the collection of all initial segments of the wellordering is definable by a Σ1‐formula with parameter κ. A short argument shows that the existence of a measurable cardinal δ implies that such wellorderings do not exist at δ‐inaccessible cardinals of cofinality not equal to δ and their successors. In contrast, our main result (...) shows that these wellorderings exist at all other uncountable cardinals in the minimal model containing a measurable cardinal. In addition, we show that measurability is the smallest large cardinal property that imposes restrictions on the existence of such wellorderings at uncountable cardinals. Finally, we generalise the above result to the minimal model containing two measurable cardinals. (shrink)

We define a generic Vopěnka cardinal to be an inaccessible cardinal \ such that for every first-order language \ of cardinality less than \ and every set \ of \-structures, if \ and every structure in \ has cardinality less than \, then an elementary embedding between two structures in \ exists in some generic extension of V. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of \-Suslin sets of (...) reals in models of ZF. In particular, we show that ZFC + is equiconsistent with ZF + \\) where \ is the pointclass of all \-Suslin sets of reals, and also with ZF + \\) + \\) where \ is the least ordinal that is not a surjective image of the reals. (shrink)

We define a generic Vopěnka cardinal to be an inaccessible cardinal \ such that for every first-order language \ of cardinality less than \ and every set \ of \-structures, if \ and every structure in \ has cardinality less than \, then an elementary embedding between two structures in \ exists in some generic extension of V. We investigate connections between generic Vopěnka cardinals in models of ZFC and the number and complexity of \-Suslin sets of (...) reals in models of ZF. In particular, we show that ZFC + is equiconsistent with ZF + \\) where \ is the pointclass of all \-Suslin sets of reals, and also with ZF + \\) + \\) where \ is the least ordinal that is not a surjective image of the reals. (shrink)

The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa $ is strongly compact if and only if the strong tree property holds at $\kappa $, and supercompact if and only if ITP holds at $\kappa $. We present several results motivated by the problem of obtaining the strong tree property and ITP at many successive (...) cardinals simultaneously; these results focus on the successors of singular cardinals. We describe a general class of forcings that will obtain the strong tree property and ITP at the successor of a singular cardinal of any cofinality. Generalizing a result of Neeman about the tree property, we show that it is consistent for ITP to hold at $\aleph _n$ for all $2 \leq n < \omega $ simultaneously with the strong tree property at $\aleph _{\omega +1}$ ; we also show that it is consistent for ITP to hold at $\aleph _n$ for all $3 < n < \omega $ and at $\aleph _{\omega +1}$ simultaneously. Finally, turning our attention to singular cardinals of uncountable cofinality, we show that it is consistent for the strong and super tree properties to hold at successors of singulars of multiple cofinalities simultaneously. (shrink)

We generalize results of [3] and [1] to hyperprojective sets of reals, viz. to more than finitely many strong cardinals being involved. We show, for example, that if every set of reals in Lω is weakly homogeneously Souslin, then there is an inner model with an inaccessible limit of strong cardinals.

In this paper, we develop primitive recursive analogues of regular cardinals by using ordinal representation systems for KPi and KPM. We also define primitive recursive analogues of inaccessible and hyperinaccessible cardinals. Moreover, we characterize the primitive recursive analogue of the least (uncountable) regular cardinal.

We show that the predicate “x is the power set of y” is ‐definable, if V = L[E] is an extender model constructed from a coherent sequences of extenders, provided that there is no inner model with a Woodin cardinal. Here is a predicate true of just the infinite cardinals. From this we conclude: the validities of second order logic are reducible to, the set of validities of the Härtig quantifier logic. Further we show that if no L[E] model (...) has a cardinal strong up to one of its ℵ‐fixed points, and, the Löwenheim number of this logic, is less than the least weakly inaccessible δ, then (i) is a limit of measurable cardinals of K, and (ii) the Weak Covering Lemma holds at δ. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. Motivated by results of Bagaria, Magidor and Väänänen, we study characterizations of large cardinal properties through reflection principles for classes of structures. More specifically, we aim to characterize notions from the lower end of the large cardinal hierarchy through the principle [math] introduced by Bagaria and Väänänen. Our results isolate a narrow interval in the large cardinal hierarchy that is bounded from below by total indescribability and from (...) above by subtleness, and contains all large cardinals that can be characterized through the validity of the principle [math] for all classes of structures defined by formulas in a fixed level of the Lévy hierarchy. Moreover, it turns out that no property that can be characterized through this principle can provably imply strong inaccessibility. The proofs of these results rely heavily on the notion of shrewd cardinals, introduced by Rathjen in a proof-theoretic context, and embedding characterizations of these cardinals that resembles Magidor’s classical characterization of supercompactness. In addition, we show that several important weak large cardinal properties, like weak inaccessibility, weak Mahloness or weak [math]-indescribability, can be canonically characterized through localized versions of the principle [math]. Finally, the techniques developed in the proofs of these characterizations also allow us to show that Hamkin’s weakly compact embedding property is equivalent to Lévy’s notion of weak [math]-indescribability. (shrink)

We show the consistency, relative to the appropriate supercompactness or strong compactness assumptions, of the existence of a non-supercompact strongly compact cardinal $\kappa _0$ (the least measurable cardinal) exhibiting properties which are impossible when $\kappa _0$ is supercompact. In particular, we construct models in which $\square _{\kappa ^+}$ holds for every inaccessible cardinal $\kappa $ except $\kappa _0$, GCH fails at every inaccessible cardinal except $\kappa _0$, and $\kappa _0$ is less than the least (...) Woodin cardinal. (shrink)

We analyze the hereditarily ordinal definable sets $\operatorname {HOD} $ in $M_n[g]$ for a Turing cone of reals x, where $M_n$ is the canonical inner model with n Woodin cardinals build over x and g is generic over $M_n$ for the Lévy collapse up to its bottom inaccessible cardinal. We prove that assuming $\boldsymbol \Pi ^1_{n+2}$ -determinacy, for a Turing cone of reals x, $\operatorname {HOD} ^{M_n[g]} = M_n,$ where $\mathcal {M}_{\infty }$ is a direct limit of iterates (...) of $M_{n+1}$, $\delta _{\infty }$ is the least Woodin cardinal in $\mathcal {M}_{\infty }$, $\kappa _{\infty }$ is the least inaccessible cardinal in $\mathcal {M}_{\infty }$ above $\delta _{\infty }$, and $\Lambda $ is a partial iteration strategy for $\mathcal {M}_{\infty }$. It will also be shown that under the same hypothesis $\operatorname {HOD}^{M_n[g]} $ satisfies $\operatorname {GCH} $. (shrink)

The main topics of this thesis are cardinal invariants, P -points and MAD families. Cardinal invariants of the continuum are cardinal numbers that are bigger than $\aleph _{0}$ and smaller or equal than $\mathfrak {c}.$ Of course, they are only interesting when they have some combinatorial or topological definition. An almost disjoint family is a family of infinite subsets of $\omega $ such that the intersection of any two of its elements is finite. A MAD family is (...) a maximal almost disjoint family. An ultrafilter $\mathcal {U}$ on $\omega $ is called a P-point if every countable $\mathcal {B\subseteq U}$ there is $X\in $ $\mathcal {U}$ such that $X\setminus B$ is finite for every $B\in \mathcal {B}.$ This kind of ultrafilters has been extensively studied, however there is still a large number of open questions about them.In the preliminaries we recall the principal properties of filters, ultrafilters, ideals, MAD families and cardinal invariants of the continuum. We present the construction of Shelah, Mildenberger, Raghavan, and Steprāns of a completely separable MAD family under $\mathfrak {s\leq a}.$ None of the results in this chapter are due to the author.The second chapter is dedicated to a principle of Sierpiński. The principle $\left $ of Sierpiński is the following statement: There is a family of functions $\left \{ \varphi _{n}:\omega _{1}\longrightarrow \omega _{1}\mid n\in \omega \right \} $ such that for every $I\in \left [ \omega _{1}\right ] ^{\omega _{1}}$ there is $n\in \omega $ for which $\varphi _{n}\left [ I\right ] =\omega _{1}.$ This principle was recently studied by Arnie Miller. He showed that this principle is equivalent to the following statement: There is a set $X=\left \{ f_{\alpha }\mid \alpha \alpha $ then $f_{\beta }\cap g$ is infinite. Miller showed that the principle of Sierpiński implies that non $\left =\omega _{1}.$ He asked if the converse was true, i.e., does non $\left =\omega _{1}$ imply the principle $\left $ of Sierpiński? We answer his question affirmatively. In other words, we show that non $\left =\omega _{1}$ is enough to construct an $\mathcal {IE}$ -Luzin set. It is not hard to see that the $\mathcal {IE}$ -Luzin set we constructed is meager. This is no coincidence, because with the aid of an inaccessible cardinal, we construct a model where non $\left =\omega _{1}$ and every $\mathcal {IE}$ -Luzin set is meager.The third chapter is dedicated to a conjecture of Hrušák. Michael Hrušák conjectured the following: Every Borel cardinal invariant is either at most non $\left $ or at least cov $\left $. Although the veracity of this conjecture is still an open problem, we were able to obtain some partial results: The conjecture is false for “Borel invariants of $\omega _{1}^{\omega }$ ” nevertheless, it is true for a large class of definable invariants. This is part of a joint work with Michael Hrušák and Jindřich Zapletal.In the fourth chapter we present a survey on destructibility of ideals and MAD families. We prove several classic theorems, but we also prove some new results. For example, we show that every almost disjoint family of size less than $\mathfrak {c}$ can be extended to a Cohen indestructible MAD family is equivalent to $\mathfrak {b=c}$. A MAD family $\mathcal {A}$ is Shelah–Steprāns if for every $X\subseteq \left [ \omega \right ] ^{<\omega }\setminus \left \{ \emptyset \right \} $ either there is $A\in \mathcal {I}\left $ such that $s\cap A\neq \emptyset $ for every $s\in X$ or there is $B\in \mathcal {I}\left $ that contains infinitely many elements of X $ denotes the ideal generated by $\mathcal {A}$ ). This concept was introduced by Raghavan which is connected to the notion of “strongly separable” introduced by Shelah and Steprāns. We prove that Shelah–Steprāns MAD families have very strong indestructibility properties: Shelah–Steprāns MAD families are indestructible for “many” definable forcings that does not add dominating reals. According to the author’s best knowledge, this is the strongest notion that has been considered in the literature so far. In spite of their strong indestructibility, Shelah–Steprāns MAD families can be destroyed by a ccc forcing that does not add unsplit or dominating reals. We also consider some strong combinatorial properties of MAD families and show the relationships between them.The fifth chapter is one of the most important chapters in the thesis. A MAD family $\mathcal {A}$ is called $+$ -Ramsey if every tree that branches into $\mathcal {I}\left $ -positive sets has an $\mathcal {I}\left $ -positive branch. Michael Hrušák’s first published question is the following: Is there a $+$ -Ramsey MAD family? It was previously known that such families can consistently exist. However, there was no construction of such families using only the axioms of ZFC. We solve this problem by constructing such a family without any extra assumptions.In the fourth and fifth chapters, we introduce several notions of MAD families, in the sixth chapter we prove several implications and non implications between them. We construct several MAD families with different properties.In the seventh chapter we build models without P -points. We show that there are no P -points after adding Silver reals either iteratively or by the side by side product. These results have some important consequences: The first one is that is its possible to get rid of P -points using only definable forcings. This answers a question of Michael Hrušák. We can also use our results to build models with no P -points and with arbitrarily large continuum, which was also an open question. These results were obtained with David Chodounský.prepared by Osvaldo Guzmán GonzálezE-mail : [email protected] : https://arxiv.org/abs/1810.09680. (shrink)

Assuming that GCH holds and [Formula: see text] is [Formula: see text]-supercompact, we construct a generic extension [Formula: see text] of [Formula: see text] in which [Formula: see text] remains strongly inaccessible and [Formula: see text] for every infinite cardinal [Formula: see text]. In particular the rank-initial segment [Formula: see text] is a model of ZFC in which [Formula: see text] for every infinite cardinal [Formula: see text].

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)

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For (...) strongly inaccessible K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K. (shrink)

We investigate the notion of strong measure zero sets in the context of the higher Cantor space $2^\kappa $ for $\kappa $ at least inaccessible. Using an iteration of perfect tree forcings, we give two proofs of the relative consistency of $$\begin{align*}|2^\kappa| = \kappa^{++} + \forall X \subseteq 2^\kappa:\ X \textrm{ is strong measure zero if and only if } |X| \leq \kappa^+. \end{align*}$$ Furthermore, we also investigate the stronger notion of stationary strong measure zero and show that the (...) equivalence of the two notions is undecidable in ZFC. (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)

In this paper, we study the union axiom of ZFC. After a brief introduction, we sketch a proof of the folklore result that union is independent of the other axioms of ZFC. In the third section, we prove some results in the theory T:= ZFC minus union. Finally, we show that the consistency of T plus the existence of an inaccessible cardinal proves the consistency of ZFC.

In this article, as implied by the title, I intend to argue for the unattainability of Cantor’s Absolute at least in terms of the proof-theoretical means of set-theory and of the theory of large cardinals. For this reason a significant part of the article is a critical review of the progress of set-theory and of mathematical foundations toward resolving problems which to the one or the other degree are associated with the concept of infinity especially the one beyond that of (...) the natural intuition of natural numbers. Naturally the review includes the foundation and development of the theory of large cardinals, especially after Cohen’s revolutionary introduction of the forcing method, insofar as it paved the way toward a transcendence of the delimitative character of Gödel’s constructible universe L and further toward ever stronger infinity assumptions. Given that Cantor in his theory of transfinite numbers defined the mathematical absolute in ontological rather than concrete mathematical terms, I proceed in the last section to a philosophical discussion with certain prompts from phenomenology regarding the transposability of the formal conception of the infinite to the level of subjective constitution and argue in these terms on the infeasibility of acceding to an ‘absolute’ infinite cardinality. Of course the argumentation is strongly based on a view of the set-theoretical universe V of von Neumann’s cumulative hierarchy as a formal representative of the essential traits one would seek from a model of Cantor’s Absolute. It is also based on the conclusions reached from the whole discussion within the context of formal-theoretical structures as such. (shrink)

The following problem is studied: How large and how small can the Löwenheim and Hanf numbers of unbounded logics be in relation to the most common large cardinals? The main result is that the Löwenheim number of the logic with the Härtig-quantifier can be consistently put in between any two of the first weakly inaccessible, the first weakly Mahlo, the first weakly compact, the first Ramsey, the first measurable and the first supercompact cardinals.

T. K. Menas [4, pp. 225-234] introduced a combinatorial property χ (μ) of a measure μ on a supercompact cardinal κ and proved that measures with this property also have the partition property. We prove here that Menas' property is not equivalent to the partition property. We also show that if α is the least cardinal greater than κ such that P κ α bears a measure without the partition property, then α is inaccessible and Π 2 (...) 1 -indescribable. (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 $\kappa$, and there is an inaccessible above $\kappa$, 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 $\kappa$ is extendible, there is an extendible Laver sequence at $\kappa$. 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)

Assuming an inaccessible cardinal $\kappa$ , there is a generic extension in which $MA + 2^{\aleph_0} = \kappa$ holds and the reals have a $\Delta^2_1$ well-ordering.

Starting with a model in which κ is the least inaccessible limit of cardinals δ which are δ+ strongly compact, we force and construct a model in which κ remains inaccessible and in which, for every cardinal γ < κ, □γ+ω fails but □γ+ω, ω holds. This generalizes a result of Ben-David and Magidor and provides an analogue in the context of strong compactness to a result of the author and Cummings in the context of supercompactness.

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)

This article continues Rosłanowski and Shelah (Int J Math Math Sci 28:63–82, 2001; Quaderni di Matematica 17:195–239, 2006; Israel J Math 159:109–174, 2007; 2011; Notre Dame J Formal Logic 52:113–147, 2011) and we introduce here a new property of (<λ)-strategically complete forcing notions which implies that their λ-support iterations do not collapse λ + (for a strongly inaccessible cardinal λ).

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by Loc(ZFC), says that every set belongs to a transitive model of ZFC. LZFC consists of Loc(ZFC) plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All ${\Pi_2}$ consequences of ZFC are provable in LZFC. LZFC strongly extends Kripke-Platek (KP) set theory minus Δ0-Collection and minus ${\in}$ -induction scheme. ZFC+ “there is an (...) inaccessible cardinal” proves the consistency of LZFC. In LZFC we focus on models rather than cardinals, a transitive model being considered as the analogue of an inaccessible cardinal. Pushing this analogy further we define α-Mahlo models and ${\Pi_1^1}$ -indescribable models, the latter being the analogues of weakly compact cardinals. Also localization axioms of the form ${Loc({\rm ZFC}+\phi)}$ are considered and their global consequences are examined. Finally we introduce the concept of standard compact cardinal (in ZFC) and some standard compactness results are proved. (shrink)

Let φ1 stand for the statement V = HOD and φ2 stand for the Ground Axiom. Suppose Ti for i = 1, …, 4 are the theories “ZFC + φ1 + φ2,” “ZFC + ¬φ1 + φ2,” “ZFC + φ1 + ¬φ2,” and “ZFC + ¬φ1 + ¬φ2” respectively. We show that if κ is indestructibly supercompact and λ > κ is inaccessible, then for i = 1, …, 4, Ai = df{δ κ is inaccessible. We show it (...) is also the case that if κ is indestructibly supercompact, then Vκ⊨T1, so by reflection, B1 = df{δ κ is inaccessible, we demonstrate that it is possible to construct a model in which κ is indestructibly supercompact and for every inaccessible cardinal δ < κ, Vδ⊨T1. It is thus not possible to prove in ZFC that Bi = df{δ < κ∣δ is an inaccessible limit of inaccessible cardinals and Vδ⊨Ti} for i = 2, …, 4 is unbounded in κ if κ is indestructibly supercompact. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

Assuming that an inaccessible cardinal exists, we construct a ZFC-model where every Δ 1 4 -set is measurable but there exists a Δ 1 4 -set without the property of Baire. By a result of Shelah, an inaccessible cardinal is necessary for this result.

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 strong compactness, but not supercompactness, is indestructible under κ‐directed closed forcing. In this model, κ is the least strongly compact cardinal, and no cardinal is supercompact up to an inaccessible cardinal. (shrink)

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let ${\sf BC}_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture. Assuming the classical Borel conjecture, $\neg{\sf BC}_{\aleph_1}$ is equivalent to the existence of a Kurepa tree of height $\aleph_1$. Using the connection of ${\sf BC}_{\kappa}$ with a generalization of Kurepa's Hypothesis, we obtain the following consistency results: 1. If it is consistent that there is a 1-inaccessible cardinal (...) then it is consistent that ${\sf BC}_{\aleph_1}$.2. If it is consistent that ${\sf BC}_{\aleph_1}$, then it is consistent that there is an inaccessible cardinal.3. If it is consistent that there is a 1-inaccessible cardinal with $\omega$ inaccessible cardinals above it, then $\neg{\sf BC}_{\aleph_{\omega}} + (\forall n < \omega){\sf BC}_{\aleph_n}$ is consistent.4. If it is consistent that there is a 2-huge cardinal, then it is consistent that ${\sf BC}_{\aleph_{\omega}}$.5. If it is consistent that there is a 3-huge cardinal, then it is consistent that ${\sf BC}_{\kappa}$ for a proper class of cardinals $\kappa$ of countable cofinality. (shrink)

We explore Woodin's Universality Theorem and consider to what extent large cardinal properties are transferred into HOD (and other inner models). We also separate the concepts of supercompactness, supercompactness in HOD and being HOD-supercompact. For example, we produce a model where a proper class of supercompact cardinals are not HOD-supercompact but are supercompact in HOD. Additionally we introduce a way to measure the degree of HOD-supercompactness of a supercompact cardinal, and we develop methods to control these degrees simultaneously (...) for a proper class of supercompact cardinals. Finally, we also produce a model in which the unique supercompact cardinal is also the only strongly compact cardinal, no cardinal is supercompact up to an inaccessible cardinal, level by level inequivalence holds and the unique supercompact cardinal is not HOD-supercompact. (shrink)

For any ordinal δ, let λδ be the least inaccessible cardinal above δ. We force and construct a model in which the least supercompact cardinal κ is indestructible under κ-directed closed forcing and in which every measurable cardinal δ < κ is < λδ strongly compact and has its < λδ strong compactness indestructible under δ-directed closed forcing of rank less than λδ. In this model, κ is also the least strongly compact cardinal. We also (...) establish versions of this result in which κ is the least strongly compact cardinal but is not supercompact. (shrink)

We study the preservation of the property of being a Solovay model under proper projective forcing extensions. We show that every strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of under strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of under projective strongly-proper forcing notions is consistent relative to the existence of a -Mahlo cardinal. We also show that the consistency strength of the (...) absoluteness of under forcing extensions with σ-linked forcing notions is exactly that of the existence of a Mahlo cardinal, in contrast with the general ccc case, which requires a weakly-compact cardinal. (shrink)