We strengthen a result of Harrington and Shelah by showing that, unless ω1 is an inaccessible cardinal in L, a relatively weak fragment of Martin's axiom implies that there exists a δ13 set of reals without the property of Baire.

We explore the consistency strength of Σ 3 1 and Σ 4 1 absoluteness, for a variety of forcing notions.

If A ⊆ ω1, then there exists a cardinal preserving generic extension [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ][x ] of [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ] by a real x such that1) A ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ] and A is Δ1HC in [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ];2) x is minimal over [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ], that is, if a set Y belongs to [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][x ], then either x ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A, Y ] or Y (...) ∈ [MATHEMATICAL DOUBLE-STRUCK CAPITAL L][A ].The forcing we use implicitly provides reshaping of the given set A. (shrink)

This paper will define a new cardinal called aStationary Cardinal. We will show that every weakly∏ 1 1 -indescribable cardinal is a stationary cardinal, every stationary cardinal is a greatly Mahlo cardinal and every stationary set of a stationary cardinal reflects. On the other hand, the existence of such a cardinal is independent of that of a∏ 1 1 -indescribable cardinal and the existence of a cardinal such that every stationary set reflects is also independent of that of a stationary (...) cardinal. As applications, we will show thatV=L implies ◊ κ 1 holds if κ is∏ 1 1 -indescribable and so forth. (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)

We prove that, in any fine structural extender model with Jensen’s λ-indexing, there is a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square(\kappa^{+})}$$\end{document} -sequence if and only if there is a pair of stationary subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa^{+} \cap {\rm {cof}}( < \kappa)}$$\end{document} without common reflection point of cofinality \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ < \kappa}$$\end{document} which, in turn, is equivalent to the existence of a (...) family of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ < \kappa}$$\end{document} of stationary subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa^{+} \cap {\rm {cof}}( < \kappa)}$$\end{document} without common reflection point of cofinality \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ < \kappa}$$\end{document}. By a result of Burke/jensen, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_\kappa}$$\end{document} fails whenever \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document} is a subcompact cardinal. Our result shows that in extender models, it is still possible to construct a canonical \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square(\kappa^{+})}$$\end{document} -sequence where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document} is the first subcompact. (shrink)

Since the work of Gödel and Cohen, which showed that Hilbert's First Problem was independent of the usual assumptions of mathematics, there have been a myriad of independence results in many areas of mathematics. These results have led to the systematic study of several combinatorial principles that have proven effective at settling many of the important independent statements. Among the most prominent of these are the principles diamond and square discovered by Jensen. Simultaneously, attempts have been made to find suitable (...) natural strengthenings of ZFC, primarily by Large Cardinal or Reflection Axioms. These two directions have tension between them in that Jensen's principles, which tend to suggest a rather rigid mathematical universe, are at odds with reflection properties. A third development was the discovery by Shelah of "PCF Theory", a generalization of cardinal arithmetic that is largely determined inside ZFC. In this paper we consider interactions between these three theories in the context of singular cardinals, focusing on the various implications between square and scales, and on consistency results between relatively strong forms of square and stationary set reflection. (shrink)

A stationary subset S of a regular uncountable cardinal κ reflects fully at regular cardinals if for every stationary set $T \subseteq \kappa$ of higher order consisting of regular cardinals there exists an α ∈ T such that S ∩ α is a stationary subset of α. Full Reflection states that every stationary set reflects fully at regular cardinals. We will prove that under a slightly weaker assumption than κ having the Mitchell order κ++ it is consistent that Full Reflection (...) holds at every λ ≤ κ and κ is measurable. (shrink)

We deal with the consistency strength of ZFC + variants of MA + suitable sets of reals are measurable (and/or Baire, and/or Ramsey). We improve the theorem of Harrington and Shelah [2] repairing the asymmetry between measure and category, obtaining also the same result for Ramsey. We then prove parallel theorems with weaker versions of Martin's axiom (MA(σ-centered), (MA(σ-linked)), MA(Γ + ℵ 0 ), MA(K)), getting Mahlo, inaccessible and weakly compact cardinals respectively. We prove that if there exists r ∈ (...) R such that ω L[ r] 1 = ω 1 and MA holds, then there exists a ▵ 1 3 -selective filter on ω, and from the consistency of ZFC we build a model for ZFC + MA(I) + every ▵ 1 3 -set of reals is Lebesgue measurable, has the property of Baire and is Ramsey. (shrink)

Martin's axiom is equivalent to the statement that the universe is absolute under ccc forcing extensions for Σ 1 sentences with a subset of $\kappa, \kappa , as a parameter.

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 destroying (...) a nonreflecting stationary set or a${\kappa ^{ + + }}$-Souslin tree, variants of Mitchell’s forcing to obtain the tree property, together with the Prikry-collapse poset for turning a large cardinal into${\aleph _\omega }$. (shrink)

We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a κ+-supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into ℵω and make the principle □ℵω,<ω fail in the generic extension. We also (...) show that by using Lévy collapse followed by standard iterated club shooting it is possible to turn a subcompact cardinal into ℵ2 and arrange in the generic extension that simultaneous reflection holds at ℵ2, and at the same time, every stationary subset of ℵ3 concentrating on points of cofinality ω has a reflection point of cofinality ω1. (shrink)

In this article, we shall show the generalized notions of distributivity of Boolean algebras have essential relations with several axioms and properties of set theory, say the Axiom of Choice, the Axiom of Dependence Choice, the Prime Ideal Theorems, Martin's axioms, Lebesgue measurability and so on.

In this paper we prove the equiconsistency of "Every $\omega_1$-tree which is first order definable over has a cofinal branch" with the existence of a $\Pi^1_1$ reflecting cardinal. We also prove that the addition of MA to the definable tree property increases the consistency strength to that of a weakly compact cardinal. Finally we comment on the generalization to higher cardinals.

It is proved, under Martin's Axiom, that all gaps in are indestructible in any forcing extension by a separable measure algebra. This naturally leads to a new type of gap, a summable gap. The results of these investigations have applications in Descriptive Set Theory. For example, it is shown that under Martin's Axiom the Baire categoricity of all Δ31 non-Δ31-complete sets of reals requires a weakly compact cardinal.

We give some general criteria, when κ-complete forcing preserves largeness properties-like κ-presaturation of normal ideals on λ (even when they concentrate on small cofinalities). Then we quite accurately obtain the consistency strength "NS λ is ℵ 1 -preserving". for λ > ℵ 2.

We use a $\kappa^{+}-Mahlo$ cardinal to give a forcing construction of a model in which there is no sequence $\langle A_{\beta} : \beta \textless \omega_{2} \rangle$ of sets of cardinality $\omega_{1}$ such that $\{\lambda \textless \omega_{2} : \existsc \subset \lambda & (\bigcupc = \lambda otp(c) = \omega_{1} & \forall \beta \textless \lambda (c \cap \beta \in A_{\beta}))\}$ is stationary.

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.

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)

Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf {GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.

We improve a theorem of Raisonnier by showing that Cons(ZFC+every Σ 2 1 -set of reals in Lebesgue measurable+every Π 2 1 -set of reals isK σ-regular) implies Cons(ZFC+there exists an inaccessible cardinal). We construct, fromL, a model where every Δ 3 1 -sets of reals is Lebesgue measurable, has the property of Baire, and every Σ 2 1 -set of reals isK σ-regular. We prove that if there exists a Σ n+1 1 unbounded filter on ω, then there exists (...) a nonK σ-regular Π 2 1 -subset. (shrink)

In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known ⋄-based constructions of Souslin trees with various additional properties may be rendered as applications of our approach. In this paper, we show that constructions following the same approach may be carried out even in the absence of ⋄. In particular, we obtain a new weak sufficient condition for the existence of Souslin trees at the level of a strongly inaccessible cardinal. We (...) also present a new construction of a Souslin tree with an ascent path, thereby increasing the consistency strength of such a tree's nonexistence from a Mahlo cardinal to a weakly compact cardinal. Section 2 of this paper is targeted at newcomers with minimal background. It offers a comprehensive exposition of the subject of constructing Souslin trees and the challenges involved. (shrink)

Let λ denote a singular cardinal. Zeman, improving a previous result of Shelah, proved that $\square _{\lambda}^{\ast}$ together with 2 λ = λ⁺ implies $\lozenge _{S}$ for every S ⊆ λ⁺ that reflects stationarily often. In this paper, for a set S ⊆ λ⁺, a normal subideal of the weak approachability ideal is introduced, and denoted by I[S; λ]. We say that the ideal is fat if it contains a stationary set. It is proved: 1. if I[S; λ] is fat, (...) then $\text{NS}_{\lambda ^{+}}$ ↾ S is non-saturated; 2. if I[S; λ] is fat and 2 λ = λ⁺, then $\lozenge _{S}$ holds; 3. $\square _{\lambda}^{\ast}$ implies that I[S; λ] is fat for every S ⊆ λ⁺ that reflects stationarily often; 4. it is relatively consistent with the existence of a supercompact cardinal that $\square _{\lambda}^{\ast}$ fails, while I[S; λ] is fat for every stationary S ⊆ λ⁺ that reflects stationarily often. The stronger principle $\lozenge _{\lambda ^{+}}^{\ast}$ is studied as well. (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.

James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...) his knowledge of set theory to a variety of areas in collaboration with other mathematicians, and he encouraged a community of mathematicians with engaging survey talks, enthusiastic discussions of open problems, and friendly mathematical conversations. (shrink)

Viale introduced covering matrices in his proof that SCH follows from PFA. In the course of the proof and subsequent work with Sharon, he isolated two reflection principles, CP and S, which, under certain circumstances, are satisfied by all covering matrices of a certain shape. Using square sequences, we construct covering matrices for which CP and S fail. This leads naturally to an investigation of square principles intermediate between □κ and □ for a regular cardinal κ. We provide a detailed (...) picture of the implications between these square principles. (shrink)

We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.

We investigate the relationship between weak square principles and simultaneous reflection of stationary sets.

The Necessary Maximality Principle for c. c. c. forcing with real parameters is equiconsistent with the existence of a weakly compact cardinal. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).

We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $\kappa $, updating some classical constructions in the process. This includes models of $\mathsf {CSR}(\kappa ^{++})\wedge {\sf TP}(\kappa ^{++})$ (both with and without ${\sf AP}(\kappa ^{++})$ ) and models of the conjunctions ${\sf SR}(\kappa ^{++}) \wedge \mathsf {wTP}(\kappa ^{++}) \wedge {\sf AP}(\kappa ^{++})$ and $\neg {\sf AP}(\kappa ^{++}) \wedge {\sf SR}(\kappa ^{++})$ (the latter was originally obtained in joint work by Krueger and (...) the first author [9], and is here given using different methods). Analogs of these results with the failure of $\sf {SH}(\kappa ^{++})$ are given as well. Finally, we obtain all of our results with an arbitrarily large $2^\kappa $, applying recent joint work by Honzik and the third author. (shrink)

We establish the consistency of the failure of the diamond principle on a cardinal [Formula: see text] which satisfies a strong simultaneous reflection property. The result is based on an analysis of Radin forcing, and further leads to a characterization of weak compactness of [Formula: see text] in a Radin generic extension.

We explore the consistency strength of Σ31 and Σ41 absoluteness, for a variety of forcing notions.