Algorithmic reducibilities of algebraic structures

DOI10.1093/LOGCOM/EXQ046zbMath1268.03041OpenAlexW2108742424MaRDI QIDQ2907058

Iskander Sh. Kalimullin

Publication date: 5 September 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e634b31c0c8a4ac282e877c8da45dadfc93d6949

zbMATH Keywords

algebraic structureenumeration degreecomputable structureTuring degreedegree spectraalgorithmic reducibilities

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items (7)

THE TREE OF TUPLES OF A STRUCTURE ⋮ Computable embeddings of classes of structures under enumeration and Turing operators ⋮ COPYING ONE OF A PAIR OF STRUCTURES ⋮ INTERPRETING A FIELD IN ITS HEISENBERG GROUP ⋮ Avoiding Medvedev reductions inside a linear order ⋮ CODING IN GRAPHS AND LINEAR ORDERINGS ⋮ Limitwise monotonic sets of reals

This page was built for publication: Algorithmic reducibilities of algebraic structures