dc.contributor.author |
Bikmukhametov R. |
|
dc.date.accessioned |
2018-09-19T20:54:56Z |
|
dc.date.available |
2018-09-19T20:54:56Z |
|
dc.date.issued |
2016 |
|
dc.identifier.issn |
1066-369X |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/143419 |
|
dc.description.abstract |
© 2016, Allerton Press, Inc.We study the algorithmic complexity of natural relations on initial segments of computable linear orders. We prove that there exists a computable linear order with computable density relation such that its Π10-initial segment has no computable presentation with a computable density relation. We also prove that the same holds for a right limit and a left limit relations. |
|
dc.relation.ispartofseries |
Russian Mathematics |
|
dc.subject |
density relation |
|
dc.subject |
initial segment |
|
dc.subject |
left limit relation |
|
dc.subject |
linear order |
|
dc.subject |
right limit relation |
|
dc.title |
Initial segments of computable linear orders with computable natural relations |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
6 |
|
dc.relation.ispartofseries-volume |
60 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
12 |
|
dc.source.id |
SCOPUS1066369X-2016-60-6-SID84971325377 |
|