LUZIN’S (N) AND RANDOMNESS REFLECTION
From MaRDI portal
Publication:5082065
DOI10.1017/JSL.2020.73OpenAlexW3094954546MaRDI QIDQ5082065FDOQ5082065
Authors: Arno Pauly, Liang Yu, Linda Brown Westrick 
Publication date: 15 June 2022
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.07517
Recommendations
Algorithmic randomness and dimension (03D32) Singular functions, Cantor functions, functions with other special properties (26A30)
Cites Work
- Algorithmic randomness and complexity.
- Computability and randomness
- Computability of probability measures and Martin-Löf randomness over metric spaces
- On initial segment complexity and degrees of randomness
- Randomness, relativization and Turing degrees
- A converse to a theorem of Steinhaus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some remarks on set theory
- Hierarchies of number-theoretic predicates
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- Lowness of higher randomness notions
- Constructive equivalence relations on computable probability measures
- Structure of the set of continuous functions with Luzin's property (N)
- Effective Jordan decomposition
- On Luzin's \((N)\)-property of the sum of two functions
- Some measure theoretic results in effective descriptive set theory
- Title not available (Why is that?)
- Recursion theory. Computational aspects of definability
- Randomness in the higher setting
- A new proof of Friedman's conjecture
- Proof of a Conjecture of Friedman
- Borel sets and hyperdegrees
Cited In (1)
This page was built for publication: LUZIN’S (N) AND RANDOMNESS REFLECTION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082065)
