Algorithmic reducibilities of algebraic structures. (English) Zbl 1268.03041
The paper under review contains examples that distinguish algorithmic reducibilities of algebraic structures which are based on the mass problems of structure presentability.
Reviewer: Marat M. Arslanov (Kazan)
MSC:
| 03C57 | Computable structure theory, computable model theory |
| 03C15 | Model theory of denumerable and separable structures |
| 03D30 | Other degrees and reducibilities in computability and recursion theory |
