RANDOMNESS IN THE HIGHER SETTING

DOI10.1017/jsl.2015.50zbMath1386.03046OpenAlexW2402189625MaRDI QIDQ2795912

Liang Yu, Chi Tat Chong

Publication date: 22 March 2016

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

Full work available at URL: https://semanticscholar.org/paper/cfd33832c8df908f17972656cb74336f427035bc

zbMATH Keywords

hyperdegrees\(\Pi^{1}_{1}\) Martin-Löf randomness\(\Pi^{1}_{1}\) randomnesshyperarithmetic theorylowness for higher randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Related Items (9)

Higher randomness and forcing with closed sets ⋮ LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ Bad oracles in higher computability and randomness ⋮ GENERICITY AND RANDOMNESS WITH ITTMS ⋮ Measure-theoretic applications of higher Demuth’s Theorem ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ Continuous higher randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Higher Kurtz randomness
• Lowness of higher randomness notions
• Recursion theory. Computational aspects of definability
• A New Proof of Friedman's Conjecture
• On a problem of Kleene’s
• Measures and their random reals
• Randomness via effective descriptive set theory

This page was built for publication: RANDOMNESS IN THE HIGHER SETTING