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