Ladder systems on trees

DOI10.1090/S0002-9939-01-05072-9zbMath0980.03049OpenAlexW1523868386MaRDI QIDQ2750905

Zoran Spasojević

Publication date: 21 October 2001

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-01-05072-9

zbMATH Keywords

Martin's axiomcountably paracompactAronszajn treesweak diamondSuslin treesladder systems on subsets of treesuniformization of colorings

Mathematics Subject Classification ID

Other combinatorial set theory (03E05)

Related Items (1)

Trees, ladders and graphs

Cites Work

• Unnamed Item
• Whitehead groups may not be free even assuming CH. II
• A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
• Separation in Countably Paracompact Spaces
• Souslin Properties and Tree Topologies
• Remarks on Souslin Properties and Tree Topologies
• When is Jones' Space Normal?
• A Note on the Normal Moore Space Conjecture

This page was built for publication: Ladder systems on trees