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