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