A club guessing toolbox. I
From MaRDI portal
Publication:6670880
DOI10.1017/bsl.2024.27MaRDI QIDQ6670880
Publication date: 24 January 2025
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
C-sequencescoherent club guessingpartitioned club guessingpostprocessing functionsrelative club guessingSierpinski-type colourings
Cites Work
- Chromatic numbers of graphs -- large gaps
- Baumgartner's conjecture and bounded forcing axioms
- Club-guessing, stationary reflection, and coloring theorems
- Colouring and non-productivity of \(\aleph_ 2\)-c.c
- Collapsing \(\omega _2\) with semi-proper forcing
- \(\mu\)-complete Souslin trees on \(\mu^ +\)
- Forcing axiom failure for any \(\lambda >\aleph_1\)
- Club guessing and the universal models
- Random trees under CH
- Game ideals
- More forcing notions imply diamond
- More Jonsson algebras
- Not collapsing cardinals \(\leq\kappa\) in \((<\kappa)\)-support iterations
- Knaster and friends. I: Closed colorings and precalibers
- Successor of singulars: Combinatorics and not collapsing cardinals \(\leq\kappa\) in \((<\kappa)\)-support iterations
- Duality and the pcf theory
- Splitting \({\mathcal P}_\kappa \lambda\) into maximally many stationary sets
- The Ostaszewski square and homogeneous Souslin trees
- On the ideal \(J[\kappa\)]
- Was Ulam right? I: basic theory and subnormal ideals
- On the growth rate of chromatic numbers of finite subgraphs
- Preservation theorems for Namba forcing
- The comparison of various club guessing principles
- A remark on Schimmerling's question
- Complicated colorings
- Walks on ordinals and their characteristics
- Higher Souslin trees and the GCH, revisited
- A microscopic approach to Souslin-tree constructions. I.
- Reflection on the coloring and chromatic numbers
- On incompactness for chromatic number of graphs
- Forcing with sequences of models of two types
- Successors of singular cardinals and coloring theorems. I
- A microscopic approach to Souslin-tree construction. II
- Complicated colorings, revisited
- CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS
- Some results about (+) proved by iterated forcing
- ℙmax variations for separating club guessing principles
- Closed sets which consistently have few translations covering the line
- REDUCED POWERS OF SOUSLIN TREES
- Jensen's diamond principle and its relatives
- Cardinal Arithmetic
- Successors of Singular Cardinals
- Parametrized Measuring and Club Guessing
- Diamonds
- Aronszajn lines and the club filter
- Antidiamond principles and topological applications
- Successors of singular cardinals and coloring theorems II
- Nonexistence of universal orders in many cardinals
- On Countably Compact, Perfectly Normal Spaces
- Topologies Determined by -Ideals on ω1
- Less saturated ideals
- Descriptive set theory and definable forcing
- A new Löwenheim-Skolem theorem
- Set Theory
- A relative of the approachability ideal, diamond and non-saturation
- Transformations of the transfinite plane
- Souslin trees at successors of regular cardinals
- Putting a diamond inside the square
- Distributive Aronszajn trees
- Reflection implies the SCH
- Club guessing sequences and filters
- The fine structure of the constructible hierarchy
- THE CLUB GUESSING IDEAL: COMMENTARY ON A THEOREM OF GITIK AND SHELAH
- Transfinite open-point games
- Fallen cardinals
- Was Ulam right? II: Small width and general ideals
- General non-structure theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A club guessing toolbox. I
