The Ostaszewski square and homogeneous Souslin trees
From MaRDI portal
Publication:2017149
DOI10.1007/s11856-013-0065-0zbMath1300.03024arXiv1105.2944OpenAlexW2094173414MaRDI QIDQ2017149
Publication date: 25 June 2014
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.2944
Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Other combinatorial set theory (03E05)
Related Items
Chromatic numbers of graphs -- large gaps, Higher Souslin trees and the GCH, revisited, A microscopic approach to Souslin-tree construction. II, A microscopic approach to Souslin-tree constructions. I., ON FOREMAN’S MAXIMALITY PRINCIPLE, Transforming rectangles into squares, with applications to strong colorings, Hedetniemi's conjecture for uncountable graphs, CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS, Putting a diamond inside the square
Cites Work
- Unnamed Item
- The uniformization property for \(chi_ 2\).
- Walks on ordinals and their characteristics
- Optimal matrices of partitions and an application to Souslin trees
- VON NEUMANN'S PROBLEM AND LARGE CARDINALS
- Diamonds
- Diamonds, uniformization
- Squares with diamonds and Souslin trees with special squares
- Jensen's ⃞ principles and the Novák number of partially ordered sets
- A relative of the approachability ideal, diamond and non-saturation
- The failure of diamond on a reflecting stationary set
- The fine structure of the constructible hierarchy