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