-
Views
-
Cite
Cite
Andrey Frolov, Maxim Zubkov, Low scattered linear orders, Journal of Logic and Computation, Volume 35, Issue 2, March 2025, exae008, https://doi.org/10.1093/logcom/exae008
- Share Icon Share
Abstract
In 1998 R. Downey formulated a problem: to describe a property |$P$| of classical order types, which guarantees that if |$\mathcal{L}$| is a low linear order and |$P$| holds for the order type of |$\mathcal{L}$| then |$\mathcal{L}$| is isomorphic to a computable linear order. We find a new such property |$P$|. Also, we give an upper bound on a complexity of an isomorphism between computable and low copies and show that this bound is sharp.
© The Author(s) 2023. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected].
This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://dbpia.nl.go.kr/journals/pages/open_access/funder_policies/chorus/standard_publication_model)
Issue Section:
Articles
You do not currently have access to this article.