A microscopic approach to Souslin-tree construction. II

DOI10.1016/j.apal.2020.102904zbMath1477.03177arXiv2003.08146OpenAlexW2224484194MaRDI QIDQ2660151

Assaf Rinot, Ari Meir Brodsky

Publication date: 29 March 2021

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08146

zbMATH Keywords

xboxpostprocessing functionparameterized proxy principleSouslin-tree constructionascent pathstreamlined trees

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65)

Related Items (7)

Sums of triples in Abelian groups ⋮ KNASTER AND FRIENDS III: SUBADDITIVE COLORINGS ⋮ Was Ulam right? II: Small width and general ideals ⋮ A large pairwise far family of Aronszajn trees ⋮ On the ideal \(J[\kappa\)] ⋮ Was Ulam right? I: basic theory and subnormal ideals ⋮ A guessing principle from a Souslin tree, with applications to topology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic numbers of graphs -- large gaps
• On guessing generalized clubs at the successors of regulars
• \(\mu\)-complete Souslin trees on \(\mu^ +\)
• Introduction to cardinal arithmetic
• Some exact equiconsistency results in set theory
• Can you take Solovay's inaccessible away?
• Souslin trees and successors of singular cardinals
• Set theory. An introduction to independence proofs
• A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\)
• Set theory. An introduction to large cardinals
• Canonical models for \(\aleph_1\)-combinatorics
• On the history of Souslin's problem
• The Souslin problem
• The Ostaszewski square and homogeneous Souslin trees
• A remark on Schimmerling's question
• More notions of forcing add a Souslin tree
• Higher Souslin trees and the GCH, revisited
• A microscopic approach to Souslin-tree constructions. I.
• Reflection on the coloring and chromatic numbers
• Set theory. Exploring independence and truth
• Iterated Cohen extensions and Souslin's problem
• ♣-like principles under CH
• REDUCED POWERS OF SOUSLIN TREES
• Jensen's diamond principle and its relatives
• Reduced powers of $ℵ_2$-trees
• Higher Souslin trees and the generalized continuum hypothesis
• On Countably Compact, Perfectly Normal Spaces
• A Note on the Combinatorial Principles ◊(E)
• On full Suslin trees
• An variation for one souslin tree
• The Suslin hypothesis and its significance for set-theoretic mathematics
• Souslin trees which are hard to specialise
• SQUARES, ASCENT PATHS, AND CHAIN CONDITIONS
• Jensen's ⃞ principles and the Novák number of partially ordered sets
• Aronszajn trees, square principles, and stationary reflection
• Souslin trees at successors of regular cardinals
• Guessing clubs in the generalized club filter
• Ascending paths and forcings that specialize higher Aronszajn trees
• SQUARES AND NARROW SYSTEMS
• Distributive Aronszajn trees
• SOUSLIN'S PROBLEM
• Souslin's Conjecture
• The fine structure of the constructible hierarchy
• A Note on Souslin's Problem

This page was built for publication: A microscopic approach to Souslin-tree construction. II