Turing reducibility as algebraic embeddability

DOI10.1007/BF02674629zbMath0937.03052OpenAlexW2008347630MaRDI QIDQ1972201

Andrey S. Morozov

Publication date: 16 April 2000

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02674629

zbMATH Keywords

Turing reducibilityTuring degreeembedding of groupsgroup of permutations of natural numbers

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (4)

Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ On computable presentations of some functional lattices

Cites Work

• Unnamed Item
• Permutations and implicit definability

This page was built for publication: Turing reducibility as algebraic embeddability