The descriptive complexity of the set of Poisson generic numbers

DOI10.1142/S0219061324500193MaRDI QIDQ6992443zbMATH OpenFDO

Authors Verónica Becher, Steve Jackson, Dominik Kwietniak, Bill Mance

Publication date 28 April 2025

Published in Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219061324500193

zbMATH Keywords

descriptive set theorynormal numbersPoisson generic numbers

Mathematics Subject Classification ID

Descriptive set theory (03E15) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Connections of number theory and logic (11U99)

Cites work

• A construction of a 𝜆-Poisson generic sequence
• Borel complexity of sets of normal numbers via generic points in subshifts with specification
• scientific article; zbMATH DE number 695608 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Normal numbers and the Borel hierarchy
• On the normality of numbers to different bases
• Poisson Generic Sequences
• Some complexity results in the theory of normal numbers
• Turing's unpublished algorithm for normal numbers

This page was built for publication: The descriptive complexity of the set of Poisson generic numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992443)