Archives
Keywords
Club Guessing Rainbow sets Minimal Walks Singular Density O-space Almost Souslin Subnormal ideal Nonspecial tree Amenable C-sequence Universal Sequences strongly bounded groups square principles P-Ideal Dichotomy Absoluteness OCA Diamond-sharp stationary hitting Poset higher Baire space Dushnik-Miller Ulam matrix Analytic sets Jonsson cardinal Sakurai's Bell inequality tensor product graph Fast club super-Souslin tree Open Access Cardinal Invariants Filter reflection specializable Souslin tree Generalized descriptive set theory Weakly compact cardinal regressive Souslin tree Dowker space SNR Rado's conjecture Subadditive sap Singular cofinality S-Space Singular cardinals combinatorics Successor of Singular Cardinal Almost-disjoint family Knaster Commutative cancellative semigroups Selective Ultrafilter Cohen real Uniformly homogeneous positive partition relation Constructible Universe Forcing Axioms Ostaszewski square weak square Ramsey theory over partitions Fat stationary set Distributive tree Hindman's Theorem diamond star Antichain Subtle cardinal Coherent tree free Souslin tree Prikry-type forcing Prevalent singular cardinals middle diamond Almost countably chromatic b-scale reflection principles Chang's conjecture coloring number Postprocessing function ccc Shelah's Strong Hypothesis Reflecting stationary set Well-behaved magma Large Cardinals indecomposable ultrafilter Strong coloring Small forcing xbox Reduced Power stick Ascent Path Diamond for trees Luzin set Slim tree nonmeager set Successor of Regular Cardinal approachability ideal Erdos-Hajnal graphs Cardinal function free Boolean algebra Whitehead Problem Fodor-type reflection Sierpinski's onto mapping principle Kurepa Hypothesis 54G20 Ineffable cardinal ZFC construction Strongly Luzin set square Diamond Knaster and friends Chromatic number C-sequence very good scale L-space countably metacompact polarized partition relation Erdos Cardinal transformations Mandelbrot set Non-saturation Souslin Tree Rock n' Roll Forcing unbounded function Parameterized proxy principle Lipschitz reduction Square-Brackets Partition Relations weak diamond Generalized Clubs Aronszajn tree Subtle tree property Hereditarily Lindelöf space Greatly Mahlo full tree Axiom R Iterated forcing weak Kurepa tree Vanishing levels Closed coloring HOD Partition Relations Local Club Condensation. Uniformly coherent projective Boolean algebra Sigma-Prikry AIM forcing PFA Martin's Axiom Hedetniemi's conjecture Microscopic Approach PFA(S)[S] club_AD Was Ulam right incompactness stationary reflection Precaliber Uniformization Foundations GMA
Tag Archives: AIM forcing
Sigma-Prikry forcing I: The Axioms
Joint work with Alejandro Poveda and Dima Sinapova. Abstract. We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality … Continue reading
Ordinal definable subsets of singular cardinals
Joint work with James Cummings, Sy-David Friedman, Menachem Magidor, and Dima Sinapova. Abstract. A remarkable result by Shelah states that if $\kappa$ is a singular strong limit cardinal of uncountable cofinality then there is a subset $x$ of $\kappa$ such … Continue reading
Posted in Publications, Singular Cardinals Combinatorics
Tagged AIM forcing, HOD, Singular cardinals combinatorics
2 Comments
