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