SQUARE WITH BUILT-IN DIAMOND-PLUS
From MaRDI portal
Publication:5359566
DOI10.1017/jsl.2016.69zbMath1422.03095OpenAlexW2751485598MaRDI QIDQ5359566
Assaf Rinot, Ralf-Dieter Schindler
Publication date: 26 September 2017
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1757e3e8ad608cae21a6527035b273ff93cbc8fa
constructibilityKurepa treesquare principlediamond principleparameterized proxy principlewalks on ordinalsalmost Souslin tree
Inner models, including constructibility, ordinal definability, and core models (03E45) Other combinatorial set theory (03E05)
Related Items
Knaster and friends. I: Closed colorings and precalibers, A large pairwise far family of Aronszajn trees, On minimal non-\(\sigma\)-scattered linear orders, REDUCED POWERS OF SOUSLIN TREES, Distributive Aronszajn trees
Cites Work
- Unnamed Item
- Hedetniemi's conjecture for uncountable graphs
- Partitioning pairs of countable ordinals
- The uniformization property for \(chi_ 2\).
- Walks on ordinals and their characteristics
- A microscopic approach to Souslin-tree constructions. I.
- Set theory. Exploring independence and truth
- CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS
- Some results about (+) proved by iterated forcing
- ZETA ELEMENTS IN DEPTH 3 AND THE FUNDAMENTAL LIE ALGEBRA OF THE INFINITESIMAL TATE CURVE
- The combinatorial principle ⋄#
- Stacking mice
- Squares with diamonds and Souslin trees with special squares
- Souslin Properties and Tree Topologies
- Trees, subtrees and order types
- Putting a diamond inside the square
- Representing trees as relatively compact subsets of the first Baire class
- Club guessing sequences and filters
- The fine structure of the constructible hierarchy
- THE CLUB GUESSING IDEAL: COMMENTARY ON A THEOREM OF GITIK AND SHELAH
