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