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