HIGHER RANDOMNESS AND LIM-SUP FORCING WITHIN AND BEYOND HYPERARITHMETIC
From MaRDI portal
Publication:5137318
DOI10.1142/9789813223523_0006zbMath1448.03034OpenAlexW2624806057MaRDI QIDQ5137318
Publication date: 2 December 2020
Published in: Sets and Computations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9789813223523_0006
Second- and higher-order arithmetic and fragments (03F35) Turing machines and related notions (03D10) Other aspects of forcing and Boolean-valued models (03E40) Higher-type and set recursion theory (03D65) Algorithmic randomness and dimension (03D32)
Related Items (3)
HIGHER RANDOMNESS AND GENERICITY ⋮ The Cichoń diagram for degrees of relative constructibility ⋮ Computability of Subsets of Metric Spaces
This page was built for publication: HIGHER RANDOMNESS AND LIM-SUP FORCING WITHIN AND BEYOND HYPERARITHMETIC
