### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Generalizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

Antichain b-scale 05D10 Diamond Commutative cancellative semigroups Erdos Cardinal Non-saturation Mandelbrot set Stevo Todorcevic square Aronszajn tree Reduced Power Forcing Axioms Distributive tree Large Cardinals Rock n' Roll Weakly compact cardinal Almost-disjoint famiy middle diamond L-space Slim tree Uniformization Knaster Postprocessing function Ostaszewski square very good scale Microscopic Approach Almost Souslin Generalized Clubs Absoluteness S-Space diamond star Cardinal function Rado's conjecture approachability ideal Uniformly coherent Poset Singular cardinals combinatorics Ascent Path incompactness Whitehead Problem square principles Forcing Jonsson cardinal Axiom R weak square Prevalent singular cardinals PFA Small forcing HOD xbox Rainbow sets tensor product graph Fodor-type reflection Minimal Walks Martin's Axiom Erdos-Hajnal graphs ccc Fat stationary set Chang's conjecture reflection principles Successor of Singular Cardinal Sakurai's Bell inequality weak diamond Club Guessing 05A17 Prikry-type forcing P-Ideal Dichotomy Nonspecial tree Hedetniemi's conjecture Constructible Universe Hereditarily Lindelöf space Hindman's Theorem 20M14 Cohen real OCA Coherent tree Fast club Kurepa Hypothesis Chromatic number Foundations Cardinal Invariants polarized partition relation coloring number Souslin Tree 11P99 Singular coﬁnality Singular Density Universal Sequences sap Shelah's Strong Hypothesis Dushnik-Miller Successor of Regular Cardinal Partition Relations Parameterized proxy principle Selective Ultrafilter stationary reflection PFA(S)[S] projective Boolean algebra stationary hitting free Boolean algebra Almost countably chromatic Square-Brackets Partition Relations

# 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 coﬁnality
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 coﬁnality
Leave a comment