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