We investigate the compatibility of I0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I_0$$\end{document} with various combinatorial principles at λ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda ^+$$\end{document}, which include the existence of λ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda ^+$$\end{document}-Aronszajn trees, square principles at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, the existence of good scales at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, stationary reflections (...) for subsets of λ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda ^{+}$$\end{document}, diamond principles at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document} and the singular cardinal hypothesis at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}. We also discuss whether these principles can hold in L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L$$\end{document}. (shrink)

We study the fine structure of the core model for one Woodin cardinal, building of the work of Mitchell and Steel on inner models of the form . We generalize to some combinatorial principles that were shown by Jensen to hold in L. We show that satisfies the statement: “□κ holds whenever κ the least measurable cardinal λ of order λ++”. We introduce a hierarchy of combinatorial principles □κ, λ for 1 λ κ such that □κ□κ, 1 □κ, λ □κ, (...) κ□κ*. We prove that if holds in V. As an application, we show that ZFC + PFA Con. We also obtain one Woodin cardinal as a lower bound on the consistency strength of stationary reflection at κ+ for a singular, countably closed limit cardinal κ such that # exists; likewise for the failure of □κ* at such a κ. (shrink)

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.

It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a supercompact cardinal that there is a uniform ultrafilter on \ which is generated by fewer than \ sets.

We develop a method for extending results about ultrafilters into a more general setting. In this paper we shall be mainly concerned with applications to cardinality logics. For example, assumingV=L, Gödel's Axiom of Constructibility, we prove that if λ > ωα then the logic with the quantifier “there existα many” is (λ,λ)-compact if and only if either λ is weakly compact or λ is singular of cofinality<ωα. As a corollary, for every infinite cardinals λ and μ, there exists a (λ,λ)-compact (...) non-(μ,μ)-compact logic if and only if either λ<μ orcfλshrink)

We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters; among them: If m ≥ 1 and the ultrafilter D is , equation imagem)-regular, then D is κ -decomposable for some κ with λ ≤ κ ≤ 2λ ). If λ is a strong limit cardinal and D is , equation imagem)-regular, then either D is -regular or there are arbitrarily large κ < λ for which D is κ -decomposable ). Suppose that λ is singular, (...) λ < κ, cf κ ≠ cf λ and D is -regular. Then: D is either -regular, or -regular for some λ' < λ . If κ is regular, then D is either -regular, or -regular for every κ' < κ . If either λ is a strong limit cardinal and λ<λ < 2κ, or λ<λ < κ, then D is either λ -decomposable, or -regular for some λ' < λ . If λ is singular, D is -regular and there are arbitrarily large ν < λ for which D is ν -decomposable, then D is κ -decomposable for some κ with λ ≤ κ ≤ λ<μ . D × D' is -regular if and only if there is a ν such that D is -regular and D' is -regular for all ν∼ < ν .We also list some problems, and furnish applications to topological spaces and to extended logics. (shrink)

We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta < \kappa $, the existence of a strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is a theorem of $\textsf{ZFC}$. Adding the requirement of subadditivity to a strongly unbounded coloring is a significant strengthening, though, and here we see that in many cases the existence of a subadditive strongly unbounded coloring (...) $c:[\kappa ]^2 \rightarrow \theta $ is independent of $\textsf{ZFC}$. We connect the existence of subadditive strongly unbounded colorings with a number of other infinitary combinatorial principles, including the narrow system property, the existence of $\kappa $ -Aronszajn trees with ascent paths, and square principles. In particular, we show that the existence of a closed, subadditive, strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is equivalent to a certain weak indexed square principle $\boxminus ^{\operatorname {\mathrm {ind}}}(\kappa, \theta )$. We conclude the paper with an application to the failure of the infinite productivity of $\kappa $ -stationarily layered posets, answering a question of Cox. (shrink)

We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf stationary subsets of must reflect simultaneously.

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)

We prove a consistency result about square principles and stationary reflection which generalises the result of Ben-David and Magidor [4].