The Ostaszewski square and homogeneous Souslin trees
From MaRDI portal
Publication:2017149
Abstract: Assume GCH and let denote an uncountable cardinal. We prove that if holds, then this may be witnessed by a coherent sequence with the following remarkable guessing property: For every sequence of unbounded subsets of , and every limit , there exists some such that , and the -element of is a member of , for all . As an application, we construct an homogenous -Souslin tree from , for every singular cardinal . In addition, as a by-product, a theorem of Farah and Velickovic, and a theorem of Abraham, Shelah and Solovay are generalized to cover the case of successors of regulars.
Recommendations
- scientific article; zbMATH DE number 3841841
- Aronszajn trees, square principles, and stationary reflection
- scientific article; zbMATH DE number 4106826
- scientific article; zbMATH DE number 3977908
- The \(n\)-dimensional Stern-Brocot tree
- Degrees of Souslin And Aronszajn Trees
- scientific article; zbMATH DE number 4039882
- Hadwiger's conjecture for squares of 2-trees
- Schur multipliers and spherical functions on homogeneous trees
- Higher Souslin trees and the GCH, revisited
Cites work
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- A relative of the approachability ideal, diamond and non-saturation
- Diamonds
- Diamonds, uniformization
- Jensen's ⃞ principles and the Novák number of partially ordered sets
- Optimal matrices of partitions and an application to Souslin trees
- Squares with diamonds and Souslin trees with special squares
- The failure of diamond on a reflecting stationary set
- The fine structure of the constructible hierarchy
- The uniformization property for \(chi_ 2\).
- VON NEUMANN'S PROBLEM AND LARGE CARDINALS
- Walks on ordinals and their characteristics
Cited in
(13)- Squares with diamonds and Souslin trees with special squares
- Putting a diamond inside the square
- REDUCED POWERS OF SOUSLIN TREES
- A microscopic approach to Souslin-tree construction. II
- On Foreman's maximality principle
- Chromatic numbers of graphs -- large gaps
- Higher Souslin trees and the GCH, revisited
- A microscopic approach to Souslin-tree constructions. I.
- Weak square sequences and special Aronszajn trees
- Hedetniemi's conjecture for uncountable graphs
- Chain conditions of products, and weakly compact cardinals
- Transforming rectangles into squares, with applications to strong colorings
- A club guessing toolbox. I
This page was built for publication: The Ostaszewski square and homogeneous Souslin trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017149)