Показать сокращенную информацию
dc.contributor.author | Zubkov M. | |
dc.date.accessioned | 2018-09-18T20:01:12Z | |
dc.date.available | 2018-09-18T20:01:12Z | |
dc.date.issued | 2009 | |
dc.identifier.issn | 0002-5232 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/135793 | |
dc.description.abstract | We study computable linear orders with computable neighborhood and block predicates. In particular, it is proved that there exists a computable linear order with a computable neighborhood predicate, having a -initial segment which is isomorphic to no computable order with a computable neighborhood predicate. On the other hand, every -initial segment of such an order has a computable copy enjoying a computable neighborhood predicate. Similar results are stated for computable linear orders with a computable block predicate replacing a neighborhood relation. Moreover, using the results obtained, we give a simpler proof for the Coles-Downey-Khoussainov theorem on the existence of a computable linear order with -initial segment, not having a computable copy. © 2009 Springer Science+Business Media, Inc. | |
dc.relation.ispartofseries | Algebra and Logic | |
dc.subject | Computability | |
dc.subject | Initial segment | |
dc.subject | Linear order | |
dc.subject | Recursiveness | |
dc.title | Initial segments of computable linear orders with additional computable predicates | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 5 | |
dc.relation.ispartofseries-volume | 48 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 321 | |
dc.source.id | SCOPUS00025232-2009-48-5-SID70949106263 |