The descriptive complexity of the set of Poisson generic numbers
Logic
2023-05-19 v1 Number Theory
Abstract
Let be an integer. We show that the set of real numbers that are Poisson generic in base is -complete in the Borel hierarchy of subsets of the real line. Furthermore, the set of real numbers that are Borel normal in base and not Poisson generic in base is complete for the class given by the differences between sets. We also show that the effective versions of these results hold in the effective Borel hierarchy.
Keywords
Cite
@article{arxiv.2305.10529,
title = {The descriptive complexity of the set of Poisson generic numbers},
author = {Verónica Becher and Stephen Jackson and Dominik Kwietniak and Bill Mance},
journal= {arXiv preprint arXiv:2305.10529},
year = {2023}
}
Comments
15 pages