Archives
Keywords
Partition relations for trees Shelah's Strong Hypothesis Jonsson cardinal stationary reflection Cardinal function HOD Rainbow sets Souslin Tree reflection principles Cardinal Invariants Square-Brackets Partition Relations Fast club PFA Foundations xbox perfectly normal Rock n' Roll Intersection model diamond star Diamond for trees Diamond-sharp Strongly Luzin set Monotonically far tensor product graph Kurepa Hypothesis Parameterized proxy principle positive partition relation Slim tree Ascending path Iterated forcing Large Cardinals Prevalent singular cardinals unbounded function Sigma-Prikry Uniformly homogeneous GMA ccc Knaster and friends Minimal Walks polarized partition relation Strongly compact cardinal Small forcing Mandelbrot set ZFC construction Precaliber Axiom R Forcing with side conditions Dowker space Reflecting stationary set transformations Closed coloring Chang's conjecture b-scale Lipschitz reduction stationary hitting Sakurai's Bell inequality Weakly compact cardinal Ineffable cardinal higher Baire space approachability ideal Erdos Cardinal projective Boolean algebra Club Guessing Generalized descriptive set theory Constructible Universe incompactness weak square Poset Ulam matrix Cohen real Countryman line Hedetniemi's conjecture Distributive tree Local Club Condensation. Postprocessing function Ostaszewski square Interval topology on trees Forcing Filter reflection Prikry-type forcing regressive Souslin tree Fodor-type reflection Partition Relations countably metacompact Dushnik-Miller Coherent tree Aronszajn tree weak diamond Well-behaved magma Absoluteness Subadditive Reduced Power Greatly Mahlo super-Souslin tree Fat stationary set Vanishing levels Was Ulam right? club_AD Uniformization Diamond very good scale Singular cardinals combinatorics SNR Amenable C-sequence Knaster Rado's conjecture sap Almost countably chromatic PFA(S)[S] C-sequence Commutative projection system Subnormal ideal nonmeager set full tree Erdos-Hajnal graphs Respecting tree L-space Open Access P-Ideal Dichotomy Sierpinski's onto mapping principle Hindman's Theorem Universal Sequences OCA Chromatic number free Souslin tree Ramsey theory over partitions Nonspecial tree weak Kurepa tree middle diamond Commutative cancellative semigroups Almost-disjoint family free Boolean algebra Luzin set stick coloring number Microscopic Approach Antichain Singular cofinality Analytic sets Almost Souslin Non-saturation Entangled linear order S-Space Uniformly coherent Successor of Regular Cardinal O-space specializable Souslin tree Ascent Path Successor of Singular Cardinal Forcing Axioms Singular Density Subtle tree property Whitehead Problem square strongly bounded groups Strong coloring Hereditarily Lindelöf space Subtle cardinal AIM forcing square principles 54G20 Martin's Axiom Selective Ultrafilter indecomposable filter Generalized Clubs
Author Archives: Assaf Rinot
50 Years of Set Theory in Toronto, May 2019
I gave an invited talk at the 50 Years of Set Theory in Toronto meeting, Fields Institute for Research in Mathematical Sciences, May 2019. Talk Title: Analytic quasi-orders and two forms of diamond Abstract: We study Borel reduction of equivalence relations … Continue reading
Posted in Invited Talks
Tagged Analytic sets, Diamond-sharp, Generalized descriptive set theory
1 Comment
Partitioning a reflecting stationary set
Joint work with Maxwell Levine. Abstract. We address the question of whether a reflecting stationary set may be partitioned into two or more reflecting stationary subsets, providing various affirmative answers in ZFC. As an application to singular cardinals combinatorics, we infer … Continue reading
4th Arctic Set Theory Workshop, January 2019
I gave an invited talk at the Arctic Set Theory Workshop 4 in Kilpisjärvi, January 2019. Talk Title: Splitting a stationary set: Is there another way? Abstract: Motivated by a problem in pcf theory, we seek for a new way … Continue reading
Posted in Invited Talks
Tagged Club Guessing, Reflecting stationary set, Ulam matrix, very good scale
Comments Off on 4th Arctic Set Theory Workshop, January 2019
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
11th Young Set Theory Workshop, June 2018
I gave a 4-lecture tutorial at the 11th Young Set Theory Workshop, Lausanne, June 2018. Title: In praise of C-sequences. Abstract. Ulam and Solovay showed that any stationary set may be split into two. Is it also the case that … Continue reading
Posted in Invited Talks
Tagged Aronszajn tree, C-sequence, incompactness, Knaster, Minimal Walks, Postprocessing function, square
Leave a comment
Knaster and friends I: Closed colorings and precalibers
Joint work with Chris Lambie-Hanson. Abstract. The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970s, consistent examples of $\kappa$-cc posets whose squares … Continue reading
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
Weak square and stationary reflection
Joint work with Gunter Fuchs. Abstract. It is well-known that the square principle $\square_\lambda$ entails the existence of a non-reflecting stationary subset of $\lambda^+$, whereas the weak square principle $\square^*_\lambda$ does not. Here we show that if $\mu^{cf(\lambda)}<\lambda$ for all $\mu<\lambda$, … Continue reading
Posted in Publications, Squares and Diamonds
Tagged 03E05, 03E35, 03E57, Diamond, Forcing Axioms, stationary reflection, weak square
Leave a comment
A strong form of König’s lemma
A student proposed to me the following strong form of König’s lemma: Conjecture. Suppose that $G=(V,E)$ is a countable a graph, and there is a partition of $V$ into countably many pieces $V=\bigcup_{n<\omega}V_n$, such that: for all $n<\omega$, $V_n$ is … Continue reading
Posted in Blog
2 Comments
The 14th International Workshop on Set Theory in Luminy, October 2017
I gave an invited talk at the 14th International Workshop on Set Theory in Luminy in Marseille, October 2017. Talk Title: Distributive Aronszajn trees Abstract: It is well-known that that the statement “all $\aleph_1$-Aronszajn trees are special” is consistent with ZFC … Continue reading
