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