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