|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, Number 6, Pages 71–72
(Mi ivm1467)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Brief communications
Relations between algorithmic reducibilities of algebraic systems
I. Sh. Kalimullin Chair of Algebra and Mathematical Logic, Kazan State University, Kazan, Russia
Abstract:
In this paper we adduce examples of various algorithmic reducibilities of algebraic systems.
Keywords:
algebraic system, Turing operator, enumeration operator, $\Sigma$-definability.
Received: 16.12.2008
Citation:
I. Sh. Kalimullin, “Relations between algorithmic reducibilities of algebraic systems”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 6, 71–72; Russian Math. (Iz. VUZ), 53:6 (2009), 58–59
Linking options:
https://www.mathnet.ru/eng/ivm1467 https://www.mathnet.ru/eng/ivm/y2009/i6/p71
|
Statistics & downloads: |
Abstract page: | 315 | Full-text PDF : | 71 | References: | 41 | First page: | 2 |
|