We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ${\neg {\rm AC}_\omega}$ in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular cardinals, we can weaken this to an equiconsistency of the following theories: “ZFC + There is a proper class of regular almost (...) Ramsey cardinals”, and “ZF + DC + All infinite cardinals except possibly successors of singular cardinals are almost Ramsey”. (shrink)

We show that the consistency of the theory “ZF + DC + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree property” follows from the consistency of a proper class of supercompact cardinals. This extends earlier results due to the author showing that the consistency of the theory “\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm ZF} + \neg{\rm AC}_\omega}$$\end{document} + Every successor cardinal is regular + Every limit cardinal (...) is singular + Every successor cardinal satisfies the tree property” follows from hypotheses stronger in consistency strength than a supercompact limit of supercompact cardinals. A lower bound in consistency strength is provided by a result of Busche and Schindler, who showed that the consistency of the theory “ZF + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree property” implies the consistency of ADL(R). (shrink)

We describe the inner models with representatives in all equivalence classes of thin equivalence relations in a given projective pointclass of even level assuming projective determinacy. The main result shows that these models are characterized by their correctness and the property that they correctly compute the tree from the appropriate scale. The main step towards this characterization shows that the tree from a scale can be reconstructed in a generic extension of an iterate of a mouse. We then construct models (...) with this property as generic extensions of iterates of mice under the assumption that the corresponding projective ordinal is below ω2ω2. On the way, we consider several related problems, including the question when forcing does not add equivalence classes to thin projective equivalence relations. For instance, we show that if every set has a sharp, then reasonable forcing does not add equivalence classes to thin provably View the MathML source Δ1/3 equivalence relations, and generalize this to all projective levels. (shrink)

We prove that various classical tree forcings—for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing—preserve the statement that every real has a sharp and hence analytic determinacy. We then lift this result via methods of inner model theory to obtain level-by-level preservation of projective determinacy (PD). Assuming PD, we further prove that projective generic absoluteness holds and no new equivalence classes are added to thin projective transitive relations by these forcings.