Archives
Keywords
Was Ulam right? Shelah's Strong Hypothesis Chang's conjecture Prikry-type forcing approachability ideal Diamond for trees Local Club Condensation. Generalized Clubs Knaster and friends Well-behaved magma Greatly Mahlo Knaster Almost countably chromatic Hedetniemi's conjecture Diamond-sharp Analytic sets Subtle cardinal Strong coloring Generalized descriptive set theory Rock n' Roll xbox Lipschitz reduction Mandelbrot set PFA Precaliber countably metacompact Chromatic number Large Cardinals 54G20 Parameterized proxy principle Singular cardinals combinatorics transformations Souslin Tree projective Boolean algebra Fast club strongly bounded groups very good scale PFA(S)[S] Jonsson cardinal specializable Souslin tree S-Space Almost Souslin Successor of Regular Cardinal Ascent Path Axiom R Uniformly coherent Selective Ultrafilter HOD Successor of Singular Cardinal sap C-sequence Cardinal Invariants super-Souslin tree Uniformization L-space stationary reflection Partition Relations SNR full tree Erdos Cardinal stick Non-saturation b-scale Microscopic Approach regressive Souslin tree free Souslin tree GMA reflection principles Almost-disjoint family Singular cofinality Weakly compact cardinal tensor product graph Fodor-type reflection Foundations coloring number middle diamond Countryman line Universal Sequences club_AD Open Access AIM forcing higher Baire space Sierpinski's onto mapping principle Strongly Luzin set stationary hitting Rado's conjecture Ineffable cardinal weak Kurepa tree weak diamond OCA Forcing Axioms Slim tree O-space Cohen real diamond star Cardinal function Luzin set square polarized partition relation Small forcing Absoluteness Respecting tree Club Guessing nonmeager set Fat stationary set Uniformly homogeneous Prevalent singular cardinals Subadditive Constructible Universe Subnormal ideal Hindman's Theorem Whitehead Problem Kurepa Hypothesis Diamond positive partition relation Ostaszewski square Poset Closed coloring Reduced Power Martin's Axiom indecomposable ultrafilter square principles ZFC construction Strongly compact cardinal Postprocessing function unbounded function Forcing Reflecting stationary set Amenable C-sequence weak square Subtle tree property P-Ideal Dichotomy Sigma-Prikry Coherent tree Square-Brackets Partition Relations Distributive tree Filter reflection Rainbow sets Ulam matrix Vanishing levels Iterated forcing Singular Density Sakurai's Bell inequality incompactness Commutative projection system Dowker space Nonspecial tree free Boolean algebra ccc Intersection model Minimal Walks Ramsey theory over partitions Aronszajn tree Erdos-Hajnal graphs Hereditarily Lindelöf space Dushnik-Miller Commutative cancellative semigroups Antichain
Tag Archives: Ineffable cardinal
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
Fake Reflection
Joint work with Gabriel Fernandes and Miguel Moreno. Abstract. We introduce a generalization of stationary set reflection which we call filter reflection, and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We … Continue reading
