KFU. Card publication. Definable relations in Turing degree structures

DEFINABLE RELATIONS IN TURING DEGREE STRUCTURES

Form of presentation

Articles in international journals and collections

Year of publication

2013

Authors, employees of KFU

Arslanov Marat Mirzaevich, author

Bibliographic description in the original language

Arslanov M.M. Definable relations in Turing degree structures, J.Logic Computation, vol. 23, No.6, 2013, p. 1145-1154

Annotation

J LOGIC COMPUT

Keywords

computably enumerable sets, Turing degrees, Ershov difference hierarchy, definable relations

The name of the journal

J LOGIC COMPUT

URL

Please use this ID to quote from or refer to the card

Field DC	Value	Language
dc.contributor.author	Arslanov Marat Mirzaevich	ru_RU
dc.date.accessioned	2013-01-01T00:00:00Z	ru_RU
dc.date.available	2013-01-01T00:00:00Z	ru_RU
dc.date.issued	2013	ru_RU
dc.identifier.citation	Arslanov M.M. Definable relations in Turing degree structures, J.Logic Computation, vol. 23, No.6, 2013, p. 1145-1154	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=70421&p_lang=2	ru_RU
dc.description.abstract	J LOGIC COMPUT	ru_RU
dc.description.abstract	J LOGIC COMPUT	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	computably enumerable sets	ru_RU
dc.subject	Turing degrees	ru_RU
dc.subject	Ershov difference hierarchy	ru_RU
dc.subject	definable relations	ru_RU
dc.title	Definable relations in Turing degree structures	ru_RU
dc.type	Articles in international journals and collections	ru_RU