Archives
Keywords
Foundations Fat stationary set Kurepa Hypothesis Strong coloring Uniformization Almost countably chromatic Microscopic Approach Jonsson cardinal Subadditive S-Space Distributive tree Sakurai's Bell inequality Nonspecial tree higher Baire space HOD Singular Density Rado's conjecture free Souslin tree OCA Cardinal Invariants Shelah's Strong Hypothesis xbox Martin's Axiom Axiom R Closed coloring Diamond Reflecting stationary set Analytic sets Aronszajn tree Subnormal ideal Local Club Condensation. Absoluteness Strongly Luzin set L-space Greatly Mahlo Filter reflection Erdos-Hajnal graphs indecomposable filter Postprocessing function PFA Intersection model Partition Relations Commutative projection system ccc Successor of Regular Cardinal polarized partition relation Vanishing levels PFA(S)[S] nonmeager set Generalized Clubs super-Souslin tree Rainbow sets Slim tree strongly bounded groups Singular cardinals combinatorics Sigma-Prikry Precaliber Erdos Cardinal Hereditarily Lindelöf space Coherent tree middle diamond incompactness Open Access Square-Brackets Partition Relations Ascent Path Forcing Fodor-type reflection Club Guessing AIM forcing Prevalent singular cardinals specializable Souslin tree Poset Successor of Singular Cardinal Whitehead Problem b-scale Almost Souslin tensor product graph Sierpinski's onto mapping principle Dowker space Uniformly coherent stick Subtle cardinal very good scale diamond star stationary reflection ZFC construction free Boolean algebra Constructible Universe Luzin set Mandelbrot set C-sequence Hedetniemi's conjecture O-space weak diamond square Antichain Commutative cancellative semigroups Chromatic number Amenable C-sequence Iterated forcing Ramsey theory over partitions Respecting tree Selective Ultrafilter Singular cofinality Subtle tree property transformations P-Ideal Dichotomy Chang's conjecture positive partition relation Small forcing Diamond-sharp Well-behaved magma Countryman line Parameterized proxy principle 54G20 Ineffable cardinal Prikry-type forcing Weakly compact cardinal Rock n' Roll Fast club weak square Large Cardinals Non-saturation Dushnik-Miller weak Kurepa tree Souslin Tree Minimal Walks unbounded function Ulam matrix coloring number stationary hitting Reduced Power regressive Souslin tree SNR Forcing Axioms projective Boolean algebra Uniformly homogeneous sap Knaster approachability ideal Cardinal function Strongly compact cardinal club_AD Knaster and friends countably metacompact GMA full tree Universal Sequences Ostaszewski square Hindman's Theorem Lipschitz reduction Almost-disjoint family Diamond for trees Cohen real square principles Generalized descriptive set theory reflection principles Was Ulam right?
Author Archives: Assaf Rinot
Was Ulam right? III: Indecomposable ideals
Joint work with Tanmay Inamdar. Abstract. We continue our study of Ulam’s measure problem. In contrast to our previous works, we shift our focus from measures stratified by their additivity, to measures stratified by their indecomposability. The breakthrough here is … Continue reading
Posted in Partition Relations, Preprints
Tagged indecomposable filter, Minimal Walks, Non-saturation, Partition Relations, Sierpinski's onto mapping principle, Ulam matrix, Was Ulam right?
Comments Off on Was Ulam right? III: Indecomposable ideals
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
Posted in Compactness, Preprints
Tagged Ascent Path, C-sequence, Intersection model, Souslin Tree, Vanishing levels
Comments Off on A new model for all C-sequences are trivial
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
Posted in Invited Talks
Tagged Countryman line
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
Ketonen’s question and other cardinal sins
Joint work with Zhixing You and Jiachen Yuan. Abstract. Intersection models of generic extensions obtained from a commutative projection systems of notions of forcing has recently regained interest, especially in the study of descriptive set theory. Here, we show that … Continue reading
Posted in Compactness, Preprints
Tagged 03E05, 03E35, 03E55, Ascent Path, C-sequence, Commutative projection system, indecomposable filter, Intersection model, Strongly compact cardinal
Comments Off on Ketonen’s question and other cardinal sins
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 only guess the branches of a Kurepa tree. We demonstrate that this variation is considerably weaker than diamond by … Continue reading
Posted in Preprints, Squares and Diamonds
Tagged Diamond, Diamond for trees, Iterated forcing, Kurepa Hypothesis, weak Kurepa tree
1 Comment
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
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
Posted in Compactness, Preprints
Tagged Forcing Axioms, indecomposable filter, Subadditive, unbounded function
Comments Off on Squares, ultrafilters and forcing axioms
