Algorithmic reducibilities of algebraic structures

DOI10.1093/LOGCOM/EXQ046MaRDI QIDQ2907058zbMATH OpenOpenAlexFDO

Authors Iskander 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 structurealgorithmic reducibilitiescomputable structuredegree spectraenumeration degreeTuring degree

Mathematics Subject Classification ID

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

Review text

The paper under review contains examples that distinguish algorithmic reducibilities of algebraic structures which are based on the mass problems of structure presentability.

Cited in

(20)

• Abstract algebraic structure of analytic theory of algorithms
• Completeness and reduction in algebraic complexity theory
• Computational algorithm for reduction type of CM abelian varieties
• Computable embeddings of classes of structures under enumeration and Turing operators
• scientific article; zbMATH DE number 3910655 (Why is no real title available?)
• Algebras with approximation and recursive data structures
• scientific article; zbMATH DE number 69362 (Why is no real title available?)
• scientific article; zbMATH DE number 177426 (Why is no real title available?)
• Abstract reduction systems and idea of Knuth-Bendix completion algorithm
• The tree of tuples of a structure
• COPYING ONE OF A PAIR OF STRUCTURES
• INTERPRETING A FIELD IN ITS HEISENBERG GROUP
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Limitwise monotonic sets of reals
• On Reduct Construction Algorithms
• Avoiding Medvedev reductions inside a linear order
• Strong reducibilities and set theory
• Relations enumerable from positive information
• A Lopez-Escobar theorem for continuous domains
• Algorithmic transformations of partial orders into linearly ordered structures

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

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