Trees, subtrees and order types
From MaRDI portal
Publication:3922670
DOI10.1016/0003-4843(81)90005-XzbMath0469.03036MaRDI QIDQ3922670
Publication date: 1981
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Related Items
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)] ⋮ Some remarks on uncountable rainbow Ramsey theory ⋮ Some higher-gap examples in combinatorial set theory ⋮ Lindelöf models of the reals: solution to a problem of Sikorski ⋮ Higher Souslin trees and the GCH, revisited ⋮ A microscopic approach to Souslin-tree constructions. I. ⋮ Morasses, square and forcing axioms ⋮ Indestructibility of compact spaces ⋮ SQUARE WITH BUILT-IN DIAMOND-PLUS ⋮ A Lindelöf space with no Lindelöf subspace of size $\aleph \textunderscore 1$ ⋮ Local coherence. ⋮ Martin’s Axiom does not imply perfectly normal non-archimedean spaces are metrizable ⋮ Characterizing large cardinals through Neeman's pure side condition forcing ⋮ The Hurewicz dichotomy for generalized Baire spaces ⋮ Kurepa trees and topological non-reflection ⋮ Non-absoluteness of model existence at $\aleph _\omega $ ⋮ Galvin's question on non-\( \sigma \)-well ordered linear orders ⋮ NOTES ON SOME ERDŐS–HAJNAL PROBLEMS ⋮ Models of Peano arithmetic and a question of Sikorski on ordered fields ⋮ Simplified morasses with linear limits ⋮ Aronszajn trees and partitions