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