We study Σ1-definable sets in the presence of large cardinals. Our results show that the existence of a Woodin cardinal and a measurable cardinal above it imply that no well-ordering of the reals is Σ1-definable, the set of all stationary subsets of ω1 is not Σ1-definable and the complement of every Σ1-definable Bernstein subset of ${}_{}^{{\omega _1}}\omega _1^{}$ is not Σ1-definable. In contrast, we show that the existence of a Woodin cardinal is compatible with the existence of a Σ1-definable well-ordering (...) of H and the existence of a Δ1-definable Bernstein subset of ${}_{}^{{\omega _1}}\omega _1^{}$. We also show that, if there are infinitely many Woodin cardinals and a measurable cardinal above them, then there is no Σ1-definable uniformization of the club filter on ω1. Moreover, we prove a perfect set theorem for Σ1-definable subsets of ${}_{}^{{\omega _1}}\omega _1^{}$, assuming that there is a measurable cardinal and the nonstationary ideal on ω1 is saturated. The proofs of these results use iterated generic ultrapowers and Woodin’s ℙmax-forcing. Finally, we also prove variants of some of these results for Σ1-definable subsets of κκ, in the case where κ itself has certain large cardinal properties. (shrink)

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 axioms.

The effects of the forcing axioms \, \ and \ on the failure of weak threaded square principles of the form \\) are analyzed. To this end, a diagonal reflection principle, \, and it implies the failure of \\) if \. It is also shown that this result is sharp. It is noted that \/\ imply the failure of \\), for every regular \, and that this result is sharp as well.

We study various classes of maximality principles, \\), introduced by Hamkins :527–550, 2003), where \ defines a class of forcing posets and \ is an infinite cardinal. We explore the consistency strength and the relationship of \\) with various forcing axioms when \. In particular, we give a characterization of bounded forcing axioms for a class of forcings \ in terms of maximality principles MP\\) for \ formulas. A significant part of the paper is devoted to studying the principle MP\\) (...) where \ and \ defines the class of stationary set preserving forcings. We show that MP\\) has high consistency strength; on the other hand, if \ defines the class of proper forcings or semi-proper forcings, then by Hamkins, MP\\) is consistent relative to \. (shrink)

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)

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)

If [Formula: see text] is regular and [Formula: see text], then the existence of a weakly presaturated ideal on [Formula: see text] implies [Formula: see text]. This partially answers a question of Foreman and Magidor about the approachability ideal on [Formula: see text]. As a corollary, we show that if there is a presaturated ideal [Formula: see text] on [Formula: see text] such that [Formula: see text] is semiproper, then CH holds. We also show some barriers to getting the tree (...) property and a saturated ideal simultaneously on a successor cardinal from conventional forcing methods. (shrink)