RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive
Izv. Vyssh. Uchebn. Zaved. Mat., 2009 Number 6, Pages 71–72 (Mi ivm1467)
This article is cited 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.

UDC: 510.5

Received: 16.12.2008


 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2009, 53:6, 58–59

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024