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