Computable Linear Orders and the Ershov Hierarchy

In this paper we provide corrections of an inaccuracy made in our previous paper. Namely, we correctly prove that there exists a computable linear order and a series of natural relations on it, the spectrum of which consist of exactly all n -c.e. degrees (for any natural number n ).

Saved in:
Bibliographic Details
Published in:Russian mathematics 2022, Vol.66 (1), p.71-74
Main Authors: Michailovskaya, Y. A., Frolov, A. N.
Format: Article
Language:English
Subjects:
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we provide corrections of an inaccuracy made in our previous paper. Namely, we correctly prove that there exists a computable linear order and a series of natural relations on it, the spectrum of which consist of exactly all n -c.e. degrees (for any natural number n ).
ISSN:1066-369X
1934-810X
DOI:10.3103/S1066369X22010066