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