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