Any \(\omega_ 1\)-tree T such that every uncountable subset of T contains an uncountable antichain is called a non Suslin tree (NST). An NSB (non Suslin base) of a T is any system F of uncountable antichains such that for every uncountable subset S of T there is a member A of F such that for every \(a\in A\) there is an \(s\in S\) such that \(a\leq s\) (of course, s depends on a). If moreover \(| F| =m\), T is quoted as m-NST; in particular, any m-NST such that \(m<c\) is called an NSB-tree. Theorem 1 (MA): If \(m<c\), there is no m-NSB-tree. Theorem 2 \((\diamond^+):\) There is a special A-tree which is not NSB. Theorem 3 (\(\diamond\)): There is a special A-tree which is NSB. Corollary 1.2: The existence of an NSB-tree cannot be proved in ZFC alone.
- Bases for Aronszajn trees
- On a refinement of anti-Souslin tree property
- A large pairwise far family of Aronszajn trees
- A new construction of a Kurepa tree with no Aronszajn subtree
- A non-metrizable collectionwise Hausdorff tree with no uncountable chains and no Aronszajn subtrees.
- scientific article; zbMATH DE number 4135932 (Why is no real title available?)
- scientific article; zbMATH DE number 96346 (Why is no real title available?)
- Consistency of Suslin's hypothesis, a nonspecial Aronszajn tree, and GCH
This page was built for publication: On Aronszajn trees with a non-Souslin base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799669)
