Computable Linear Orders and the Ershov Hierarchy

dc.date.accessioned	2019-01-22T20:41:33Z
dc.date.available	2019-01-22T20:41:33Z
dc.date.issued	2018
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/148310
dc.description.abstract	© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For any natural number n, the degree spectrum of such relations of some computable linear orders contains exactly all n-computable enumerable degrees. We also study interconnections of these relations among themselves.
dc.relation.ispartofseries	Russian Mathematics
dc.subject	computable linear orders
dc.subject	degree spectrum of relations
dc.subject	n-computable enumerable degrees
dc.title	Computable Linear Orders and the Ershov Hierarchy
dc.type	Article
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	62
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	58
dc.source.id	SCOPUS1066369X-2018-62-1-SID85043302158

Files in this item

Size: 382.5Kb

Format: PDF

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