Показать сокращенную информацию
dc.contributor.author | Kalimullin I. | |
dc.date.accessioned | 2018-09-18T20:31:37Z | |
dc.date.available | 2018-09-18T20:31:37Z | |
dc.date.issued | 2008 | |
dc.identifier.issn | 0037-4466 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/140793 | |
dc.description.abstract | We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Moreover, we solve Miller's problem of distinguishing incomparable degrees by the spectra of linear orderings. © Pleiades Publishing, Ltd. 2008. | |
dc.relation.ispartofseries | Siberian Mathematical Journal | |
dc.subject | Computable algebraic structure | |
dc.subject | Computably enumerable set | |
dc.subject | Relative computability | |
dc.subject | Turing degree | |
dc.title | Restrictions on the degree spectra of algebraic structures | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 6 | |
dc.relation.ispartofseries-volume | 49 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 1034 | |
dc.source.id | SCOPUS00374466-2008-49-6-SID57749181113 |