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:
Bibliographic Details
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
id sg-ntu-dr.10356-146870
record_format dspace
spelling sg-ntu-dr.10356-1468702023-02-28T19:30:15Z Computable linear orders and products Frolov, Andrey N. Lempp, Steffen Ng, Keng Meng Wu, Guohua School of Physical and Mathematical Sciences Science::Mathematics Computable Linear Order Product 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. Ministry of Education (MOE) Published version A. N. F. is supported by the grant of RF President MD-2721.2019.1. S. L.’s research was partially supported by NSF grant DMS-1600228 and AMS-Simons Foundation Collaboration Grant 209087. K. M. N. is partially supported by the grants MOE2015-T2-2-055 and RG131/17. G. W. is partially supported by M4020333 (MOE2016-T2-1-083), M4011672 (RG32/16) and M4011274 (RG29/14) from Ministry of Education Singapore. A. N. F. and S. L. wish to thank the New Zealand Mathematics Research Institute, during the 2017 Summer School of which part of this research was carried out. S.L. also wishes to thank Nanyang Technological University where part of this research was carried out. 2021-03-12T04:35:29Z 2021-03-12T04:35:29Z 2020 Journal Article Frolov, A. N., Lempp, S., Ng, K. M. & Wu, G. (2020). Computable linear orders and products. Journal of Symbolic Logic, 85(2), 605-623. https://dx.doi.org/10.1017/jsl.2020.17 0022-4812 https://hdl.handle.net/10356/146870 10.1017/jsl.2020.17 2-s2.0-85100135993 2 85 605 623 en MOE2015-T2-2-055 MOE2016-T2-1-083 RG131/17 RG32/16 RG29/14 Journal of Symbolic Logic © 2020 The Association for Symbolic Logic. All rights reserved. This paper was published by Cambridge University Press in The Journal of Symbolic Logic and is made available with permission of The Association for Symbolic Logic. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Science::Mathematics
Computable Linear Order
Product
spellingShingle Science::Mathematics
Computable Linear Order
Product
Frolov, Andrey N.
Lempp, Steffen
Ng, Keng Meng
Wu, Guohua
Computable linear orders and products
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Frolov, Andrey N.
Lempp, Steffen
Ng, Keng Meng
Wu, Guohua
format Article
author Frolov, Andrey N.
Lempp, Steffen
Ng, Keng Meng
Wu, Guohua
author_sort Frolov, Andrey N.
title Computable linear orders and products
title_short Computable linear orders and products
title_full Computable linear orders and products
title_fullStr Computable linear orders and products
title_full_unstemmed Computable linear orders and products
title_sort computable linear orders and products
publishDate 2021
url https://hdl.handle.net/10356/146870
_version_ 1759856437697183744