Archives
Keywords
very good scale Microscopic Approach Hereditarily Lindelöf space regressive Souslin tree Hedetniemi's conjecture Vanishing levels Sigma-Prikry Uniformization Lipschitz reduction OCA Erdos Cardinal Kurepa Hypothesis Iterated forcing strongly bounded groups Sakurai's Bell inequality PFA Absoluteness Non-saturation club_AD Ulam matrix coloring number Generalized descriptive set theory reflection principles Cardinal function transformations Strong coloring square principles Rock n' Roll Precaliber Mandelbrot set P-Ideal Dichotomy Singular Density Diamond nonmeager set stick Shelah's Strong Hypothesis Sierpinski's onto mapping principle Singular cardinals combinatorics Dowker space Commutative cancellative semigroups GMA Weakly compact cardinal Dushnik-Miller Almost-disjoint family Aronszajn tree Club Guessing square Uniformly homogeneous xbox C-sequence Knaster and friends L-space Partition Relations ZFC construction Knaster Analytic sets Axiom R Coherent tree diamond star Square-Brackets Partition Relations Prikry-type forcing Ineffable cardinal sap Small forcing Large Cardinals Rainbow sets Souslin Tree Whitehead Problem countably metacompact Almost countably chromatic Subtle cardinal Cohen real Greatly Mahlo Selective Ultrafilter Minimal Walks approachability ideal Subadditive Fodor-type reflection Postprocessing function Fat stationary set Constructible Universe Successor of Singular Cardinal Subnormal ideal Antichain super-Souslin tree Hindman's Theorem HOD Luzin set Chang's conjecture polarized partition relation Universal Sequences specializable Souslin tree Rado's conjecture unbounded function Local Club Condensation. Cardinal Invariants 54G20 stationary reflection O-space tensor product graph Ramsey theory over partitions higher Baire space Forcing b-scale full tree Foundations middle diamond S-Space Diamond-sharp Diamond for trees free Boolean algebra Poset Reduced Power ccc Uniformly coherent Singular cofinality indecomposable ultrafilter Forcing Axioms projective Boolean algebra Erdos-Hajnal graphs Subtle tree property Jonsson cardinal Strongly Luzin set weak square Generalized Clubs Slim tree free Souslin tree Open Access Successor of Regular Cardinal Distributive tree Ostaszewski square Well-behaved magma Parameterized proxy principle Amenable C-sequence AIM forcing Prevalent singular cardinals Fast club incompactness positive partition relation Closed coloring PFA(S)[S] Martin's Axiom Nonspecial tree Filter reflection weak diamond Ascent Path SNR Almost Souslin stationary hitting Was Ulam right Reflecting stationary set Chromatic number
Tag Archives: Parameterized proxy principle
Proxy principles in combinatorial set theory
Joint work with Ari Meir Brodsky and Shira Yadai. Abstract. The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged C-sequence, free Souslin tree, Parameterized proxy principle, Souslin Tree, specializable Souslin tree, square principles, xbox
Comments Off on Proxy principles in combinatorial set theory
The vanishing levels of a tree
Joint work with Shira Yadai and Zhixing You. Abstract. We initiate the study of the spectrum $Vspec(\kappa)$ of sets that can be realized as the vanishing levels $V(\mathbf T)$ of a normal $\kappa$-tree $\mathbf T$. The latter is an invariant in … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged Almost-disjoint family, C-sequence, Coherent tree, Parameterized proxy principle, regressive Souslin tree, Subtle tree property, Uniformly homogeneous, Vanishing levels
Comments Off on The vanishing levels of a tree
Full Souslin trees at small cardinals
Joint work with Shira Yadai and Zhixing You. Abstract. A $\kappa$-tree is full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full $\kappa$-Souslin tree may consistently exist. Shelah gave an affirmative … Continue reading
Posted in Preprints, Souslin Hypothesis
Tagged Diamond for trees, full tree, Greatly Mahlo, Microscopic Approach, Parameterized proxy principle, Subtle cardinal, tensor product graph
Comments Off on Full Souslin trees at small cardinals
A microscopic approach to Souslin-tree constructions. Part II
Joint work with Ari Meir Brodsky. Abstract. In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known $\diamondsuit$-based constructions of Souslin trees with various additional properties may be rendered as applications of … Continue reading
Souslin trees at successors of regular cardinals
Abstract. We present a weak sufficient condition for the existence of Souslin trees at successor of regular cardinals. The result is optimal and simultaneously improves an old theorem of Gregory and a more recent theorem of the author. Downloads: Citation … Continue reading
Posted in Publications, Souslin Hypothesis
Tagged Parameterized proxy principle, Souslin Tree
1 Comment
A remark on Schimmerling’s question
Joint work with Ari Meir Brodsky. Abstract. Schimmerling asked whether $\square^*_\lambda$ together with GCH entails the existence of a $\lambda^+$-Souslin tree, for a singular cardinal $\lambda$. Here, we provide an affirmative answer under the additional assumption that there exists a … Continue reading
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
More notions of forcing add a Souslin tree
Joint work with Ari Meir Brodsky. Abstract. An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing … Continue reading
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
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 $\kappa$-Souslin trees that is insensitive to the identity of … Continue reading
Posted in Invited Talks
Tagged Microscopic Approach, Parameterized proxy principle, Souslin Tree
Leave a comment