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