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