The descriptive complexity of the set of Poisson generic numbers

Journal of Mathematical Logic (forthcoming)
  Copy   BIBTEX

Abstract

Let [Formula: see text] be an integer. We show that the set of real numbers that are Poisson generic in base [Formula: see text] is [Formula: see text]-complete in the Borel hierarchy of subsets of the real line. Furthermore, the set of real numbers that are Borel normal in base [Formula: see text] and not Poisson generic in base [Formula: see text] is complete for the class given by the differences between [Formula: see text] sets. We also show that the effective versions of these results hold in the effective Borel hierarchy.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A descriptive Main Gap Theorem.Francesco Mangraviti & Luca Motto Ros - 2020 - Journal of Mathematical Logic 21 (1):2050025.
New jump operators on equivalence relations.John D. Clemens & Samuel Coskey - 2022 - Journal of Mathematical Logic 22 (3).
Mass problems and hyperarithmeticity.Joshua A. Cole & Stephen G. Simpson - 2007 - Journal of Mathematical Logic 7 (2):125-143.
A strong law of computationally weak subsets.Bjørn Kjos-Hanssen - 2011 - Journal of Mathematical Logic 11 (1):1-10.
The mouse set theorem just past projective.Mitch Rudominer - forthcoming - Journal of Mathematical Logic.
Independence in randomizations.Uri Andrews, Isaac Goldbring & H. Jerome Keisler - 2019 - Journal of Mathematical Logic 19 (1):1950005.

Analytics

Added to PP
2024-03-16

Downloads
13 (#1,310,210)

6 months
10 (#379,980)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references