Archives
Keywords
Forcing Axioms Open Access HOD Entangled linear order Erdos-Hajnal graphs Closed coloring Dushnik-Miller Aronszajn tree Shelah's Strong Hypothesis stationary hitting Weakly compact cardinal perfectly normal square principles Mandelbrot set Almost countably chromatic SNR O-space Foundations Generalized Clubs ZFC construction Iterated forcing Partition relations for trees Ramsey theory over partitions Fat stationary set 54G20 Analytic sets Universal Sequences Small forcing Commutative cancellative semigroups reflection principles Slim tree Subadditive very good scale Dowker space regressive Souslin tree tensor product graph L-space Generalized descriptive set theory Hereditarily Lindelöf space Reflecting stationary set stick Filter reflection Martin's Axiom Ineffable cardinal polarized partition relation Chromatic number Diamond higher Baire space PFA(S)[S] Subtle cardinal ccc club_AD Sierpinski's onto mapping principle free Boolean algebra GMA Coherent tree Ulam matrix weak diamond Rado's conjecture Sakurai's Bell inequality Square-Brackets Partition Relations Postprocessing function Ascent Path Successor of Regular Cardinal nonmeager set Large Cardinals Microscopic Approach middle diamond Strongly compact cardinal sap Respecting tree Subnormal ideal Singular Density Parameterized proxy principle indecomposable filter weak square Chang's conjecture stationary reflection projective Boolean algebra Vanishing levels Ascending path Absoluteness Intersection model Whitehead Problem coloring number Uniformly homogeneous Minimal Walks Knaster Rainbow sets Precaliber Local Club Condensation. Uniformization Luzin set xbox Jonsson cardinal Well-behaved magma Amenable C-sequence C-sequence Strongly Luzin set positive partition relation Club Guessing Partition Relations countably metacompact b-scale Greatly Mahlo square Lipschitz reduction weak Kurepa tree Poset Diamond for trees S-Space Cardinal Invariants Distributive tree Reduced Power Antichain unbounded function Successor of Singular Cardinal super-Souslin tree Strong coloring Almost-disjoint family Almost Souslin Rock n' Roll Countryman line Nonspecial tree approachability ideal Knaster and friends Commutative projection system Was Ulam right? Uniformly coherent Cohen real transformations Ostaszewski square Erdos Cardinal Monotonically far Kurepa Hypothesis Fast club incompactness Sigma-Prikry Hindman's Theorem Non-saturation Hedetniemi's conjecture strongly bounded groups Cardinal function full tree Diamond-sharp Axiom R PFA Forcing with side conditions specializable Souslin tree P-Ideal Dichotomy Subtle tree property OCA Forcing AIM forcing Prevalent singular cardinals Souslin Tree Singular cofinality Singular cardinals combinatorics Constructible Universe Prikry-type forcing free Souslin tree diamond star Selective Ultrafilter Interval topology on trees Fodor-type reflection
Author Archives: Assaf Rinot
A new model for all C-sequences are trivial
Joint work with Zhixing You and Jiachen Yuan. Abstract. We construct a model in which all C-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question from a previous paper, and provides an … Continue reading
Posted in Compactness, Publications
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Subtle tree property, Vanishing levels
2 Comments
MFO workshop in Set Theory, January 2025
I gave an invited talk at the Set Theory meeting in Obwerwolfach, January 2025. Talk Title: Non-structure theorems for higher Aronszajn lines. Abstract: An $\omega_1$-Countryman line is an uncountable linear order $L$ such that $L^2$ (with the pointwise ordering) is … Continue reading
Posted in Invited Talks
Tagged Countryman line, Monotonically far
Comments Off on MFO workshop in Set Theory, January 2025
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. We investigate global structural properties of linear orders of a fixed infinite size. It is classical that the countable linear orders and the continuum-sized orders exhibit contrasting behaviours. Modern results show that strong extensions … Continue reading
Posted in Basis problems, Partition Relations, Preprints
Tagged Aronszajn tree, Ascending path, Club Guessing, Countryman line, Entangled linear order, Minimal Walks, Monotonically far, Partition relations for trees, Strong coloring, Subtle tree property, Vanishing levels, ZFC construction
2 Comments
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Answering a question of Ketonen from the late 1970’s, it is proved that a weakly compact cardinal carrying an indecomposable ultrafilter need not be measurable. The result is obtained by analyzing … Continue reading
120 Years of Choice, July 2024
I gave an invited talk at the 120 Years of Choice conference, July 2024. Talk Title: Mathematician’s best friend Abstract: Jensen’s diamond is a very useful postulate. It is well-known that it implies the continuum hypothesis, that it is equivalent … Continue reading
Diamond on Kurepa trees
Joint work with Ziemek Kostana and Saharon Shelah. Abstract. We introduce a new weak variation of diamond that is meant to guess only the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by … Continue reading
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
Squares, ultrafilters and forcing axioms
Joint work with Chris Lambie-Hanson and Jing Zhang. Abstract. We study the interplay of the three families of combinatorial objects or principles. Specifically, we show the following. Strong forcing axioms, in general incompatible with the existence of indexed squares, can … Continue reading
May the successor of a singular cardinal be Jonsson?
Abstract: Whether the successor of a singular cardinal can be Jónsson is a very old and famous open problem in set theory. Here, we collect necessary conditions for an affirmative answer, and put forward a list of closely-related questions in … Continue reading
Posted in Open Problems, Singular Cardinals Combinatorics
Tagged Jonsson cardinal, Open Access
1 Comment
