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