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