A Forcing Axiom Deciding the Generalized Souslin Hypothesis
From MaRDI portal
Publication:4632767
DOI10.4153/CJM-2017-058-2WikidataQ113999192 ScholiaQ113999192MaRDI QIDQ4632767
Assaf Rinot, Chris Lambie-Hanson
Publication date: 30 April 2019
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.06932
Consistency and independence results (03E35) Other combinatorial set theory (03E05) Generic absoluteness and forcing axioms (03E57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models with second order properties. V: A general principle
- S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
- S-forcing. IIa: Adding diamonds and more applications: Coding sets, Arhangel'skii's problem and \({\mathcal L}[Q_ 1^{<\omega},Q^ 1_ 2\). (With an appendix by John P. Burgess)]
- Martin's maximum, saturated ideals, and nonregular ultrafilters. I
- Aspects of constructibility
- An \(\aleph_1\)-dense ideal on \(\aleph_2\)
- Suslin trees, the bounding number, and partition relations
- Walks on ordinals and their characteristics
- Higher Souslin trees and the GCH, revisited
- A microscopic approach to Souslin-tree constructions. I.
- Iterated Cohen extensions and Souslin's problem
- Conjectures of Rado and Chang and special Aronszajn trees
- REDUCED POWERS OF SOUSLIN TREES
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
- đ_{đ}đ combinatorics. I. Stationary coding sets rationalize the club filter
- Diamonds
- Morasses, diamond, and forcing
- The âľ 2 \1-Souslin Hypothesis
- Aronszajn trees, square principles, and stationary reflection
- The failure of diamond on a reflecting stationary set
- SOUSLIN'S PROBLEM
- Aronszajn trees and the independence of the transfer property
- The fine structure of the constructible hierarchy
- Sur un problème de Sikorski
This page was built for publication: A Forcing Axiom Deciding the Generalized Souslin Hypothesis
