Algorithmic reducibilities of algebraic structures

dc.contributor.author	Kalimullin I.
dc.date.accessioned	2018-09-18T20:11:23Z
dc.date.available	2018-09-18T20:11:23Z
dc.date.issued	2012
dc.identifier.issn	0955-792X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/137405
dc.description.abstract	We describe all possible relations between certain reducibities of algebraic structures which are based on the mass problems of structure presentability. © 2010 The Author. Published by Oxford University Press. All rights reserved.
dc.relation.ispartofseries	Journal of Logic and Computation
dc.subject	Algebraic structure
dc.subject	constructivizible (computable) structure
dc.subject	degree spectra of models
dc.subject	e-degrees (enumeration degrees)
dc.subject	Turing degrees
dc.title	Algorithmic reducibilities of algebraic structures
dc.type	Conference Paper
dc.relation.ispartofseries-issue	4
dc.relation.ispartofseries-volume	22
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	831
dc.source.id	SCOPUS0955792X-2012-22-4-SID84864745976

Files in this item

Name: SCOPUS0955792X-20 ...

Size: 43.43Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.