Normalizing notations in the Ershov hierarchy

Mathematical Logic Quarterly 67 (4):506-513 (2021)
  Copy   BIBTEX

Abstract

The Turing degrees of infinite levels of the Ershov hierarchy were studied by Liu and Peng [8]. In this paper, we continue the study of Turing degrees of infinite levels and lift the study of density property to the levels beyond ω2. In doing so, we rely on notations with some nice properties. We introduce the concept of normalizing notations and generate normalizing notations for higher levels. The generalizations of the weak density theorem and the nondensity theorem are proved for higher levels in the Ershov hierarchy. Furthermore, we also investigate the minimal degrees in the infinite levels of the Ershov hierarchy.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2023-08-28

Downloads
4 (#1,013,551)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations