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