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