Quasi-bounded trees and analytic inductions

DOI10.4064/fm191-2-4zbMath1097.03043OpenAlexW1967523034MaRDI QIDQ5479117

Jean Saint Raymond

Publication date: 6 July 2006

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/fm191-2-4

zbMATH Keywords

inductionBorel gamesdominating trees

Mathematics Subject Classification ID

Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Related Items (4)

Descriptive set Theory of Families of Small Sets ⋮ The descriptive complexity of the set of all closed zero-dimensional subsets of a Polish space ⋮ Haar negligibility of positive cones in Banach spaces ⋮ An upper bound on the complexity of recognizable tree languages

This page was built for publication: Quasi-bounded trees and analytic inductions