dc.contributor.author |
Frolov A.N. |
|
dc.contributor.author |
Lempp S. |
|
dc.contributor.author |
Ng K.M. |
|
dc.contributor.author |
Wu G. |
|
dc.date.accessioned |
2021-02-24T20:33:05Z |
|
dc.date.available |
2021-02-24T20:33:05Z |
|
dc.date.issued |
2020 |
|
dc.identifier.issn |
0022-4812 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/160842 |
|
dc.description.abstract |
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with the property that given any countable linear order, is a computable linear order iff is a computable linear order, as exactly the finite nonempty order types. |
|
dc.relation.ispartofseries |
Journal of Symbolic Logic |
|
dc.subject |
computable linear order |
|
dc.subject |
product |
|
dc.title |
Computable linear orders and products |
|
dc.type |
Article |
|
dc.relation.ispartofseries-issue |
2 |
|
dc.relation.ispartofseries-volume |
85 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.relation.startpage |
605 |
|
dc.source.id |
SCOPUS00224812-2020-85-2-SID85100135993 |
|