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