[HTML][HTML] Measure properties of regular sets of trees
T Gogacz, H Michalewski, M Mio… - Information and …, 2017 - Elsevier
Information and Computation, 2017•Elsevier
We investigate measure theoretic properties of regular sets of infinite trees. As a first result,
we prove that every regular set is universally measurable and that every Borel measure on
the Polish space of trees is continuous with respect to a natural transfinite stratification of
regular sets into ω 1 ranks. We also expose a connection between regular sets and the σ-
algebra of R-sets, introduced by A. Kolmogorov in 1928 as a foundation for measure theory.
We show that the game tree languages W i, k are Wadge-complete for the finite levels of the …
we prove that every regular set is universally measurable and that every Borel measure on
the Polish space of trees is continuous with respect to a natural transfinite stratification of
regular sets into ω 1 ranks. We also expose a connection between regular sets and the σ-
algebra of R-sets, introduced by A. Kolmogorov in 1928 as a foundation for measure theory.
We show that the game tree languages W i, k are Wadge-complete for the finite levels of the …
We investigate measure theoretic properties of regular sets of infinite trees. As a first result, we prove that every regular set is universally measurable and that every Borel measure on the Polish space of trees is continuous with respect to a natural transfinite stratification of regular sets into ω 1 ranks. We also expose a connection between regular sets and the σ-algebra of R-sets, introduced by A. Kolmogorov in 1928 as a foundation for measure theory. We show that the game tree languages W i, k are Wadge-complete for the finite levels of the hierarchy of R-sets. We apply these results to answer positively an open problem regarding the game interpretation of the probabilistic μ-calculus.
Elsevier
Showing the best result for this search. See all results