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