No CrossRef data available.
Published online by Cambridge University Press: 20 July 2020
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.