Higher Recursion Theory

DOI10.1017/9781316717301zbMath1365.03011OpenAlexW1538838225MaRDI QIDQ5274767

Gerald E. Sacks

Publication date: 6 July 2017

Full work available at URL: https://doi.org/10.1017/9781316717301

zbMATH Keywords

hyperarithmetichigher recursion theorymetarecursionE-recursioncomputations in normal functionalsHigher type computations\(\alpha \)-recursion

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Related Items (5)

Higher randomness and forcing with closed sets ⋮ STRUCTURAL HIGHNESS NOTIONS ⋮ Higher Kurtz randomness ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis

This page was built for publication: Higher Recursion Theory