Archives
Keywords
Ascent Path projective Boolean algebra Almost-disjoint family Shelah's Strong Hypothesis full tree Poset incompactness Iterated forcing Commutative projection system Universal Sequences approachability ideal Subtle cardinal club_AD countably metacompact Microscopic Approach Fat stationary set Diamond Chromatic number free Boolean algebra Lipschitz reduction Subnormal ideal indecomposable ultrafilter Parameterized proxy principle P-Ideal Dichotomy Erdos-Hajnal graphs Precaliber Partition Relations regressive Souslin tree HOD Respecting tree PFA(S)[S] Well-behaved magma Foundations PFA reflection principles Strong coloring middle diamond free Souslin tree specializable Souslin tree Postprocessing function very good scale Mandelbrot set Coherent tree Absoluteness Singular cardinals combinatorics Square-Brackets Partition Relations Prevalent singular cardinals Uniformly homogeneous Subtle tree property Non-saturation Analytic sets Small forcing Rock n' Roll Cardinal function L-space stick Greatly Mahlo strongly bounded groups Cardinal Invariants Almost countably chromatic Slim tree Generalized Clubs Knaster and friends Luzin set b-scale polarized partition relation Distributive tree weak square stationary hitting O-space square Erdos Cardinal ccc Filter reflection OCA Open Access Sigma-Prikry Diamond for trees coloring number weak Kurepa tree Intersection model Kurepa Hypothesis Diamond-sharp Constructible Universe Club Guessing sap super-Souslin tree Selective Ultrafilter Vanishing levels Jonsson cardinal AIM forcing Weakly compact cardinal Local Club Condensation. Strongly Luzin set Countryman line positive partition relation Rado's conjecture Fodor-type reflection Ulam matrix Singular cofinality C-sequence Forcing xbox Dowker space Whitehead Problem Hereditarily Lindelöf space ZFC construction Generalized descriptive set theory SNR Sakurai's Bell inequality Antichain Nonspecial tree Martin's Axiom Rainbow sets Sierpinski's onto mapping principle Reduced Power diamond star nonmeager set Uniformly coherent unbounded function Dushnik-Miller GMA higher Baire space Successor of Regular Cardinal Forcing Axioms S-Space stationary reflection Reflecting stationary set Successor of Singular Cardinal Prikry-type forcing Subadditive tensor product graph Was Ulam right? Ramsey theory over partitions square principles Ineffable cardinal Almost Souslin weak diamond 54G20 transformations Singular Density Knaster Closed coloring Large Cardinals Cohen real Axiom R Commutative cancellative semigroups Chang's conjecture Souslin Tree Aronszajn tree Minimal Walks Hindman's Theorem Strongly compact cardinal Fast club Hedetniemi's conjecture Ostaszewski square Amenable C-sequence Uniformization
Tag Archives: Souslin Tree
Prikry forcing may add a Souslin tree
A celebrated theorem of Shelah states that adding a Cohen real introduces a Souslin tree. Are there any other examples of notions of forcing that add a
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
Prolific Souslin trees
In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing
Posted in Blog, Expository
Tagged Rainbow sets, Souslin Tree, Square-Brackets Partition Relations
Leave a comment
A microscopic approach to Souslin-tree constructions. Part I
Joint work with Ari Meir Brodsky. Abstract. We propose a parameterized proxy principle from which
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
P.O.I. Workshop in pure and descriptive set theory, September 2015
I gave an invited talk at the P.O.I Workshop in pure and descriptive set theory, Torino, September 26, 2015. Title:
Reduced powers of Souslin trees
Joint work with Ari Meir Brodsky. Abstract. We study the relationship between a
Forcing and its Applications Retrospective Workshop, April 2015
I gave an invited talk at Forcing and its Applications Retrospective Workshop, Toronto, April 1st, 2015. Title: A microscopic approach to Souslin trees constructions Abstract: We present an approach to construct
Posted in Invited Talks
Tagged Microscopic Approach, Parameterized proxy principle, Souslin Tree
Leave a comment
Forcing with a Souslin tree makes
I was meaning to include a proof of Farah’s lemma in my previous post, but then I realized that the slick proof assumes some background which may worth spelling out, first. Therefore, I am dedicating a short post for a … Continue reading
Forcing with a Souslin tree makes
I was meaning to include a proof of Farah’s lemma in my previous post, but then I realized that the slick proof assumes some background which may worth spelling out, first. Therefore, I am dedicating a short post for a … Continue reading
The P-Ideal Dichotomy and the Souslin Hypothesis
John Krueger is visiting Toronto these days, and in a conversation today, we asked ourselves how do one prove the Abraham-Todorcevic theorem that PID implies SH. Namely, that the next statement implies that there are no Souslin trees: Definition. The … Continue reading
