A club guessing toolbox. I
type: Item
instance of: scholarly article
title: A club guessing toolbox. I
author: Tanmay Inamdar
author: Assaf Rinot
published in: The Bulletin of Symbolic Logic
publication date: 2025-01-24T00:00:00Z
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 03E35
zbMATH DE Number: 7974423
zbMATH Keywords: relative club guessing
zbMATH Keywords: partitioned club guessing
zbMATH Keywords: coherent club guessing
zbMATH Keywords: C-sequences
zbMATH Keywords: postprocessing functions
zbMATH Keywords: Sierpinski-type colourings
MaRDI profile type: MaRDI publication profile
cites work: Cardinal Arithmetic
cites work: Q4982445
cites work: Baumgartner's conjecture and bounded forcing axioms
cites work: Parametrized Measuring and Club Guessing
cites work: Closed sets which consistently have few translations covering the line
cites work: A microscopic approach to Souslin-tree constructions. I.
cites work: REDUCED POWERS OF SOUSLIN TREES
cites work: Distributive Aronszajn trees
cites work: A remark on Schimmerling's question
cites work: A microscopic approach to Souslin-tree construction. II
cites work: Topologies Determined by -Ideals on ω1
cites work: Club guessing and the universal models
cites work: Club-guessing, stationary reflection, and coloring theorems
cites work: Successors of Singular Cardinals
cites work: Antidiamond principles and topological applications
cites work: Successors of singular cardinals and coloring theorems. I
cites work: Successors of singular cardinals and coloring theorems II
cites work: THE CLUB GUESSING IDEAL: COMMENTARY ON A THEOREM OF GITIK AND SHELAH
cites work: A new Löwenheim-Skolem theorem
cites work: Less saturated ideals
cites work: Preservation theorems for Namba forcing
cites work: Q3393126
cites work: Random trees under CH
cites work: Was Ulam right? I: basic theory and subnormal ideals
cites work: Was Ulam right? II: Small width and general ideals
cites work: Club guessing sequences and filters
cites work: The comparison of various club guessing principles
cites work: \(\mathbb P_{\max}\) variations for separating club guessing principles
cites work: Some results about (+) proved by iterated forcing
cites work: Set Theory
cites work: The fine structure of the constructible hierarchy
cites work: Nonexistence of universal orders in many cardinals
cites work: \(\mu\)-complete Souslin trees on \(\mu^ +\)
cites work: Fallen cardinals
cites work: On the growth rate of chromatic numbers of finite subgraphs
cites work: Knaster and friends. I: Closed colorings and precalibers
cites work: Reflection on the coloring and chromatic numbers
cites work: Game ideals
cites work: Aronszajn lines and the club filter
cites work: Forcing with sequences of models of two types
cites work: On Countably Compact, Perfectly Normal Spaces
cites work: A relative of the approachability ideal, diamond and non-saturation
cites work: Jensen's diamond principle and its relatives
cites work: Chain conditions of products, and weakly compact cardinals
cites work: Complicated colorings
cites work: The Ostaszewski square and homogeneous Souslin trees
cites work: Chromatic numbers of graphs -- large gaps
cites work: Putting a diamond inside the square
cites work: Higher Souslin trees and the GCH, revisited
cites work: Souslin trees at successors of regular cardinals
cites work: On the ideal \(J[\kappa]\)
cites work: Transformations of the transfinite plane
cites work: Complicated colorings, revisited
cites work: More forcing notions imply diamond
cites work: Q4326402
cites work: Colouring and non-productivity of \(\aleph_ 2\)-c.c
cites work: Q4375363
cites work: Q4523072
cites work: More Jonsson algebras
cites work: Not collapsing cardinals \(\leq\kappa\) in \((<\kappa)\)-support iterations
cites work: Successor of singulars: Combinatorics and not collapsing cardinals \(\leq\kappa\) in \((<\kappa)\)-support iterations
cites work: Forcing axiom failure for any \(\lambda >\aleph_1\)
cites work: Reflection implies the SCH

A club guessing toolbox. I (cites work)
cites work: Diamonds

A club guessing toolbox. I (cites work)
cites work: On incompactness for chromatic number of graphs

A club guessing toolbox. I (cites work)
cites work: General non-structure theory

A club guessing toolbox. I (cites work)
cites work: Duality and the pcf theory

A club guessing toolbox. I (cites work)
cites work: Splitting \({\mathcal P}_\kappa \lambda\) into maximally many stationary sets

A club guessing toolbox. I (cites work)
cites work: Q4550727

A club guessing toolbox. I (cites work)
cites work: Walks on ordinals and their characteristics

A club guessing toolbox. I (cites work)
cites work: Collapsing \(\omega _2\) with semi-proper forcing

A club guessing toolbox. I (cites work)
cites work: Transfinite open-point games

A club guessing toolbox. I (cites work)
cites work: Descriptive set theory and definable forcing

A club guessing toolbox. I (cites work)
cites work: Q5444715

A club guessing toolbox. I (DOI)
DOI: 10.1017/BSL.2024.27