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