Computable linear orders and products
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.
Saved in:
Main Authors: | Frolov, Andrey N., Lempp, Steffen, Ng, Keng Meng, Wu, Guohua |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/146870 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Automata on ordinals and automaticity of linear orders
by: Schlicht, P., et al.
Published: (2014) -
Automatic linear orders and trees
by: Khoussainov, B., et al.
Published: (2013) -
The Kierstead's Conjecture and limitwise monotonic functions
by: Wu, Guohua, et al.
Published: (2020) -
Tree-automatic scattered linear orders
by: Jain S., et al.
Published: (2020) -
On the role of the collection principle for ∑2 0 -formulas in second-order reverse mathematics
by: Chong, C.T., et al.
Published: (2014)