Quasi-bounded trees and analytic inductions
Fundamenta Mathematicae, Tome 191 (2006) no. 2, pp. 175-185
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
A tree $T$ on $\omega $ is said to be cofinal if for every $\alpha \in \omega ^\omega $ there is some branch $\beta $ of $T$ such that $\alpha \leq \beta $, and
quasi-bounded otherwise. We prove that the set of quasi-bounded trees is a complete
${\bf\Sigma }^1_1$-inductive set. In particular, it is neither analytic nor co-analytic.
Keywords:
tree omega said cofinal every alpha omega omega there branch beta alpha leq beta quasi bounded otherwise prove set quasi bounded trees complete sigma inductive set particular neither analytic nor co analytic
Affiliations des auteurs :
Jean Saint Raymond 1
@article{10_4064_fm191_2_4,
author = {Jean Saint Raymond},
title = {Quasi-bounded trees and analytic inductions},
journal = {Fundamenta Mathematicae},
pages = {175--185},
publisher = {mathdoc},
volume = {191},
number = {2},
year = {2006},
doi = {10.4064/fm191-2-4},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/fm191-2-4/}
}
Jean Saint Raymond. Quasi-bounded trees and analytic inductions. Fundamenta Mathematicae, Tome 191 (2006) no. 2, pp. 175-185. doi: 10.4064/fm191-2-4
Cité par Sources :