Computable embeddings of classes of structures under enumeration and Turing operators

DOI10.1134/S1995080218010146zbMath1483.03027OpenAlexW2794192548MaRDI QIDQ2412951

Iskander Sh. Kalimullin

Publication date: 6 April 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080218010146

zbMATH Keywords

elementary theoriesstructural propertiesErhsov's hierarchyenumeration degreesTuring degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Computable embeddings for pairs of linear orders ⋮ A note on computable embeddings for ordinals and their reverses

Cites Work

• Algorithmic reducibilities of algebraic structures
• Turing computable embeddings
• Comparing Classes of Finite Structures

This page was built for publication: Computable embeddings of classes of structures under enumeration and Turing operators