Randomness via effective descriptive set theory
From MaRDI portal
Publication:5294149
Recommendations
Cited in
(19)- The random members of a \({\Pi }_{1}^{0}\) class
- Recognizing strong random reals
- A new proof of Friedman's conjecture
- Measure-theoretic applications of higher Demuth's theorem
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness
- scientific article; zbMATH DE number 7204368 (Why is no real title available?)
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- Randomness and degree theory for infinite time register machines
- Higher randomness and forcing with closed sets
- Higher randomness and forcing with closed sets
- Higher randomness and genericity
- Genericity and randomness with ITTMs
- Randomness in the higher setting
- Higher Kurtz randomness
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- Lowness of higher randomness notions
- \({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
- Bad oracles in higher computability and randomness
- Continuous higher randomness
This page was built for publication: Randomness via effective descriptive set theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294149)