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