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