LUZIN’S (N) AND RANDOMNESS REFLECTION

DOI10.1017/jsl.2020.73OpenAlexW3094954546MaRDI QIDQ5082065

Arno Pauly, Liang Yu, Linda Brown Westrick

Publication date: 15 June 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.07517

zbMATH Keywords

computable analysishigher randomnessLuzin's (N)randomness reflection

Mathematics Subject Classification ID

Singular functions, Cantor functions, functions with other special properties (26A30) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Luzin's \((N)\)-property of the sum of two functions
• Lowness of higher randomness notions
• Constructive equivalence relations on computable probability measures
• Some measure theoretic results in effective descriptive set theory
• Effective Jordan decomposition
• Recursion theory. Computational aspects of definability
• Computability of probability measures and Martin-Löf randomness over metric spaces
• A converse to a theorem of Steinhaus
• Some remarks on set theory
• RANDOMNESS IN THE HIGHER SETTING
• Algorithmic Randomness and Complexity
• A New Proof of Friedman's Conjecture
• Hierarchies of number-theoretic predicates
• On initial segment complexity and degrees of randomness
• Proof of a Conjecture of Friedman
• Borel sets and hyperdegrees
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Randomness, relativization and Turing degrees
• Structure of the set of continuous functions with Luzin's property (N)

This page was built for publication: LUZIN’S (N) AND RANDOMNESS REFLECTION