Archives
Keywords
middle diamond Strongly compact cardinal Chromatic number Partition relations for trees Successor of Singular Cardinal Parameterized proxy principle C-sequence Respecting tree Axiom R O-space Forcing Souslin Tree Jonsson cardinal higher Baire space S-Space Ulam matrix specializable Souslin tree Universal Sequences Cardinal Invariants Commutative projection system GMA Open Access Cohen real weak square Successor of Regular Cardinal Distributive tree Hedetniemi's conjecture Uniformly coherent Closed coloring Amenable C-sequence Commutative cancellative semigroups countably metacompact reflection principles Precaliber Vanishing levels Nonspecial tree stationary reflection Fat stationary set Reflecting stationary set SNR xbox Sigma-Prikry weak diamond Singular Density Ascending path sap Subtle cardinal P-Ideal Dichotomy PFA polarized partition relation Rainbow sets transformations Martin's Axiom L-space ccc Whitehead Problem Knaster Subadditive Uniformly homogeneous projective Boolean algebra Cardinal function Club Guessing super-Souslin tree Non-saturation Absoluteness Constructible Universe Coherent tree Luzin set b-scale Aronszajn tree positive partition relation Microscopic Approach Foundations Subnormal ideal coloring number Monotonically far Ascent Path Fast club Singular cardinals combinatorics indecomposable filter full tree Reduced Power nonmeager set Diamond Uniformization Large Cardinals Erdos Cardinal Forcing Axioms stationary hitting Partition Relations club_AD Slim tree Almost countably chromatic Antichain PFA(S)[S] Selective Ultrafilter very good scale Strong coloring Minimal Walks Countryman line HOD square principles Diamond for trees AIM forcing Lipschitz reduction Interval topology on trees Kurepa Hypothesis Knaster and friends Poset Dowker space Small forcing free Souslin tree Generalized descriptive set theory Ineffable cardinal ZFC construction Sakurai's Bell inequality Fodor-type reflection Mandelbrot set unbounded function diamond star approachability ideal Forcing with side conditions stick Was Ulam right? Postprocessing function Filter reflection Ostaszewski square Rado's conjecture Ramsey theory over partitions regressive Souslin tree Hereditarily Lindelöf space Sierpinski's onto mapping principle Shelah's Strong Hypothesis free Boolean algebra Weakly compact cardinal OCA Prevalent singular cardinals Almost-disjoint family Singular cofinality Greatly Mahlo Well-behaved magma Chang's conjecture Dushnik-Miller weak Kurepa tree Generalized Clubs Intersection model perfectly normal Entangled linear order strongly bounded groups Hindman's Theorem Iterated forcing Rock n' Roll Diamond-sharp Square-Brackets Partition Relations Strongly Luzin set Subtle tree property square Almost Souslin incompactness Prikry-type forcing Analytic sets tensor product graph Erdos-Hajnal graphs 54G20 Local Club Condensation.
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
