No CrossRef data available.
Article contents
COMPUTABLE LINEAR ORDERS AND PRODUCTS
Published online by Cambridge University Press: 20 July 2020
Abstract
We characterize the linear order types
$\tau $
with the property that given any countable linear order
$\mathcal {L}$
,
$\tau \cdot \mathcal {L}$
is a computable linear order iff
$\mathcal {L}$
is a computable linear order, as exactly the finite nonempty order types.
Keywords
MSC classification
- Type
- Articles
- Information
- Copyright
- © The Association for Symbolic Logic 2020
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20210920181309745-0723:S0022481220000171:S0022481220000171_inline5.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20210920181309745-0723:S0022481220000171:S0022481220000171_inline6.png?pub-status=live)