No CrossRef data available.
Article contents
SOME RESULTS ON FINITELY SPLITTING SUBTREES OF ARONSZAJN TREES
Published online by Cambridge University Press: 15 September 2025
Abstract
For any 
$2 \le n < \omega $, we introduce a forcing poset using generalized promises which adds a normal n-splitting subtree to a 
$(\ge \! n)$-splitting normal Aronszajn tree. Using this forcing poset, we prove several consistency results concerning finitely splitting subtrees of Aronszajn trees. For example, it is consistent that there exists an infinitely splitting Suslin tree whose topological square is not Lindelöf, which solves an open problem due to Marun. For any 
$2 < n < \omega $, it is consistent that every 
$(\ge \! n)$-splitting normal Aronszajn tree contains a normal n-splitting subtree, but there exists a normal infinitely splitting Aronszajn tree which contains no 
$(< \! n)$-splitting subtree. To show the latter consistency result, we prove a forcing iteration preservation theorem related to not adding new small-splitting subtrees of Aronszajn trees.
Information
- Type
- Article
- Information
- Copyright
- © The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic
References
Abraham, U. and Shelah, S.,
A
${\varDelta}_2^2$
-well order of the reals and incompactness of
$L({Q}^{MM})$
.
Annals of Pure and Applied Logic
, vol. 59 (1993), no. 1, pp. 1–32.Google Scholar
${\varDelta}_2^2$
-well order of the reals and incompactness of
$L({Q}^{MM})$
.
Annals of Pure and Applied Logic
, vol. 59 (1993), no. 1, pp. 1–32.Google ScholarDevlin, K. and Johnsbråten, H., The Souslin problem, Lecture Notes in Mathematics, 405, Springer-Verlag, Berlin, 1974.Google Scholar
Jech, T.,
Set Theory. The Third Millennium Edition, Revised and Expanded
, Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2003, xiv+769.Google Scholar
Lamei Ramandi, H. and Moore, J. T.,
There may be no minimal non-
$\sigma$
-scattered linear orders
.
Mathematical Research Letters
, vol. 25 (2018), no. 7, pp. 1957–1975.Google Scholar
$\sigma$
-scattered linear orders
.
Mathematical Research Letters
, vol. 25 (2018), no. 7, pp. 1957–1975.Google ScholarLindström, I.,
Degrees of Souslin and Aronszajn trees
.
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik
, vol. 33 (1987), no. 2, pp. 159–170.Google Scholar
Marun, P.,
Spaces, trees and labelled sets
, Ph.D. thesis, Carnegie Mellon University, 2024.Google Scholar
Marun, P.,
Square compactness and Lindelöf trees
.
Archive for Mathematical Logic
, vol. 63 (2024), pp. 741–757.Google Scholar
Miyamoto, T.,
${\omega}_1$
-Souslin trees under countable support iterations
.
Fundamenta Mathematicae
, vol. 142 (1993), no. 3, pp. 257–261.Google Scholar
${\omega}_1$
-Souslin trees under countable support iterations
.
Fundamenta Mathematicae
, vol. 142 (1993), no. 3, pp. 257–261.Google ScholarMoore, J. T.,
$\kern2pt{\omega}_1$
and
${-}{\omega}_1$
may be the only minimal uncountable linear orders
.
Michigan Mathematical Journal
, vol. 55 (2007), no. 2, 437–457.Google Scholar
$\kern2pt{\omega}_1$
and
${-}{\omega}_1$
may be the only minimal uncountable linear orders
.
Michigan Mathematical Journal
, vol. 55 (2007), no. 2, 437–457.Google ScholarNyikos, P.,
Various topologies on trees
,
Proceedings of the Tennessee Topology Conference
(P. R. Misra and M. Rajagopalan, editors), World Scientific Publishing, River Edge, 1997, pp. 167–198.Google Scholar
Shelah, S.,
Proper and Improper Forcing
, second ed., Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1998.Google Scholar
Willard, S.,
General Topology
, Addison-Wesley Publishing Co., Reading, 1970, xii+369 pp.Google Scholar