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