Archives
Keywords
Knaster Subtle cardinal Small forcing Singular cofinality Strongly Luzin set 54G20 transformations Large Cardinals Cardinal function L-space Uniformization indecomposable ultrafilter Axiom R Forcing Axioms Ascent Path Rado's conjecture stationary reflection reflection principles Vanishing levels Selective Ultrafilter Foundations unbounded function Constructible Universe Mandelbrot set Fodor-type reflection Ineffable cardinal Hereditarily Lindelöf space Amenable C-sequence Universal Sequences SNR Subadditive Dushnik-Miller Prikry-type forcing square Sierpinski's onto mapping principle Commutative projection system b-scale tensor product graph Dowker space Iterated forcing Ostaszewski square Successor of Regular Cardinal Well-behaved magma Minimal Walks ZFC construction Analytic sets Weakly compact cardinal HOD Filter reflection Whitehead Problem Almost Souslin Rainbow sets Commutative cancellative semigroups Nonspecial tree Diamond-sharp GMA Singular cardinals combinatorics Almost-disjoint family Rock n' Roll full tree Slim tree Was Ulam right Sigma-Prikry Generalized descriptive set theory Lipschitz reduction Subnormal ideal coloring number Intersection model Hindman's Theorem Reduced Power projective Boolean algebra Local Club Condensation. Ramsey theory over partitions P-Ideal Dichotomy countably metacompact Non-saturation Jonsson cardinal Respecting tree very good scale Closed coloring S-Space Microscopic Approach weak square Fat stationary set Uniformly coherent xbox Countryman line Shelah's Strong Hypothesis free Souslin tree PFA club_AD Diamond for trees Sakurai's Bell inequality C-sequence Almost countably chromatic Chang's conjecture Club Guessing strongly bounded groups square principles Prevalent singular cardinals AIM forcing Erdos-Hajnal graphs Postprocessing function Chromatic number Cardinal Invariants middle diamond Erdos Cardinal Ulam matrix Parameterized proxy principle stationary hitting Diamond Aronszajn tree ccc Absoluteness positive partition relation Open Access Uniformly homogeneous Fast club higher Baire space sap Subtle tree property weak diamond Square-Brackets Partition Relations Reflecting stationary set polarized partition relation PFA(S)[S] Poset Strongly compact cardinal Singular Density Cohen real diamond star approachability ideal super-Souslin tree Precaliber Coherent tree Luzin set Greatly Mahlo Martin's Axiom Forcing Antichain OCA Strong coloring weak Kurepa tree Souslin Tree stick regressive Souslin tree O-space Successor of Singular Cardinal Hedetniemi's conjecture specializable Souslin tree Kurepa Hypothesis incompactness Partition Relations free Boolean algebra Distributive tree Generalized Clubs Knaster and friends nonmeager set
Tag Archives: Club Guessing
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with … Continue reading
Winter School in Abstract Analysis, January 2023
I gave a 3-lecture tutorial at the Winter School in Abstract Analysis in Steken, January 2023. Title: Club guessing Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove … Continue reading
A club guessing toolbox I
Joint work with Tanmay Inamdar. Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove Shelah’s ZFC bound on the power of the first singular cardinal. These principles have … Continue reading
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
Distributive Aronszajn trees
Joint work with Ari Meir Brodsky. Abstract. Ben-David and Shelah proved that if $\lambda$ is a singular strong-limit cardinal and $2^\lambda=\lambda^+$, then $\square^*_\lambda$ entails the existence of a $\lambda$-distributive $\lambda^+$-Aronszajn tree. Here, it is proved that the same conclusion remains … Continue reading
Partitioning the club guessing
In a recent paper, I am making use of the following fact. Theorem (Shelah, 1997). Suppose that $\kappa$ is an accessible cardinal (i.e., there exists a cardinal $\theta<\kappa$ such that $2^\theta\ge\kappa)$. Then there exists a sequence $\langle g_\delta:C_\delta\rightarrow\omega\mid \delta\in E^{\kappa^+}_\kappa\rangle$ … Continue reading
Shelah’s approachability ideal (part 2)
In a previous post, we defined Shelah’s approachability ideal $I[\lambda]$. We remind the reader that a subset $S\subseteq\lambda$ is in $I[\lambda]$ iff there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$ such that for club many $\delta\in S$, the union … Continue reading
Posted in Blog, Expository, Open Problems
Tagged approachability ideal, Club Guessing
Leave a comment
Shelah’s approachability ideal (part 1)
Given an infinite cardinal $\lambda$, Shelah defines an ideal $I[\lambda]$ as follows. Definition (Shelah, implicit in here). A set $S$ is in $I[\lambda]$ iff $S\subseteq\lambda$ and there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$, and some club $E\subseteq\lambda$, so … Continue reading
An inconsistent form of club guessing
In this post, we shall present an answer (due to P. Larson) to a question by A. Primavesi concerning a certain strong form of club guessing. We commence with recalling Shelah’s concept of club guessing. Concept (Shelah). Given a regular … Continue reading
