Permutation groups and ideals of Turing degrees
From MaRDI portal
Cites work
- A certain reducibility on admissible sets
- A Jump Inversion Theorem for the Degree Spectra
- Algorithmic randomness and complexity.
- Computability and randomness
- Computable Structure Theory
- Computable structures and the hyperarithmetical hierarchy
- Degrees of Structures
- Existence of an inseparable pair in the recursive theory of admissible sets
- Families of permutations and ideals of Turing degrees
- Fixed points for the jump operator
- HF-computability
- scientific article; zbMATH DE number 3715539 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 890268 (Why is no real title available?)
- Lowness properties and randomness
- Notes on the Jump of a Structure
- On principles of computability on admissible sets
- On the representation of partial recursive functions as superpositions
- Permutations and implicit definability
- Reducibility on families
- S-Subsets of Natural Numbers
- The jump operation for structure degrees
This page was built for publication: Permutation groups and ideals of Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028291)