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