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