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