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