Codings on linear orders and algorithmic independence of natural relations

dc.contributor.author	Bikmukhametov R.
dc.date.accessioned	2018-09-18T20:34:45Z
dc.date.available	2018-09-18T20:34:45Z
dc.date.issued	2014
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/141337
dc.description.abstract	© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear orders relative to the class of their computable presentations. We give complete description of possible combinations of natural relations for which there is a computable linear order such that in any of its computable presentation a given combination of relations is not computable.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	algorithmic independence
dc.subject	block relation
dc.subject	coding
dc.subject	computable presentation
dc.subject	density relation
dc.subject	left limit relation
dc.subject	linear order
dc.subject	neighborhood relation
dc.subject	right limit relation
dc.title	Codings on linear orders and algorithmic independence of natural relations
dc.type	Article
dc.relation.ispartofseries-issue	4
dc.relation.ispartofseries-volume	35
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	327
dc.source.id	SCOPUS19950802-2014-35-4-SID84915820280

Файлы в этом документе

Имя: SCOPUS19950802-20 ...

Размер: 43.62Kb

Формат: PDF

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