### Archives

### Recent blog posts

- A strong form of König’s lemma October 21, 2017
- 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

### Keywords

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

# Tag Archives: ccc

## Generalizations of Martin’s Axiom and the well-met condition

Recall that Martin’s Axiom asserts that for every partial order $\mathbb P$ satisfying c.c.c., and for any family $\mathcal D$ of $<2^{\aleph_0}$ many dense subsets of $\mathbb P$, there exists a directed subset $G$ of $\mathbb P$ such that $G\cap … Continue reading

## Chain conditions of products, and weakly compact cardinals

Abstract. The history of productivity of the $\kappa$-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every … Continue reading

Posted in Partition Relations, Publications
Tagged Aronszajn tree, ccc, Fat stationary set, Minimal Walks, square, Weakly compact cardinal
2 Comments

## c.c.c. vs. the Knaster property

After my previous post on Mekler’s characterization of c.c.c. notions of forcing, Sam, Mike and myself discussed the value of it . We noticed that a prevalent verification of the c.c.c. goes like this: given an uncountable set of conditions, … Continue reading

## c.c.c. forcing without combinatorics

In this post, we shall discuss a short paper by Alan Mekler from 1984, concerning a non-combinatorial verification of the c.c.c. property for forcing notions. Recall that a notion of forcing $\mathbb P$ is said to satisfy the c.c.c. iff … Continue reading