Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/146870
Title: Computable linear orders and products
Authors: Frolov, Andrey N.
Lempp, Steffen
Ng, Keng Meng
Wu, Guohua
Keywords: Science::Mathematics
Issue Date: 2020
Source: 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
Project: MOE2015-T2-2-055
MOE2016-T2-1-083
RG131/17
RG32/16
RG29/14
Journal: Journal of Symbolic Logic
Abstract: 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.
URI: https://hdl.handle.net/10356/146870
ISSN: 0022-4812
DOI: 10.1017/jsl.2020.17
Rights: © 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.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
computable-linear-orders-and-products.pdf275.25 kBAdobe PDFView/Open

Page view(s)

80
Updated on Jan 16, 2022

Download(s)

19
Updated on Jan 16, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.