Some Combinatorial Properties of Trees

DOI10.1112/BLMS/14.3.213MaRDI QIDQ3671956zbMATH OpenOpenAlexFDO

Authors Stevo Todorčević

Publication date 1982

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/blms/14.3.213

zbMATH Keywords

Aronszajn treecofinal branchcollapsing of cardinalsspecial tree

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40)

Cited in

(6)

• Small forcings and Cohen reals
• Namba forcing, weak approximation, and guessing
• Specializing trees and answer to a question of Williams
• Fresh function spectra
• Reflection principles, GCH and the uniformization properties
• On indestructible strongly guessing models

This page was built for publication: Some Combinatorial Properties of Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671956)