Turing reducibility as algebraic embeddability

DOI10.1007/BF02674629MaRDI QIDQ1972201zbMATH OpenOpenAlexFDO

Authors Andrei 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 degreeTuring reducibilityembedding of groupsgroup of permutations of natural numbers

Mathematics Subject Classification ID

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

Recommendations

• Turing degrees and automorphism groups of substructure lattices
• Embeddings into the Turing degrees
• Algebraic aspects of the computably enumerable degrees.
• Turing degrees of isomorphism types of algebraic objects

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Permutations and implicit definability

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972201)