Families of permutations and ideals of Turing degrees

DOI10.1007/s10469-023-09714-1OpenAlexW4389310666MaRDI QIDQ6148009

Andrey S. Morozov, V. G. Puzarenko, M. Kh. Faizrachmanov

Publication date: 11 January 2024

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-023-09714-1

zbMATH Keywords

jumpTuring degreedegree spectracomputable permutationfamily of permutationsideal of Turing degrees

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducibility on families
• Upper bounds on ideals in the computably enumerable Turing degrees
• Fixed points for the jump operator
• The jump operation for structure degrees
• On strongly jump traceable reals
• Index sets related to prompt simplicity
• Permutations and implicit definability
• Existence of an inseparable pair in the recursive theory of admissible sets
• Lowness properties and randomness
• Notes on the Jump of a Structure
• A Jump Inversion Theorem for the Degree Spectra
• Degrees of Structures
• Computable Structure Theory
• S-Subsets of Natural Numbers
• Inherent enumerability of strong jump-traceability
• Degrees in Which the Recursive Sets are Uniformly Recursive

This page was built for publication: Families of permutations and ideals of Turing degrees