A semilattice generated by superlow computably enumerable degrees

Faizrakhmanov, M. Kh.

doi:10.3103/s1066369x11010087

Search citation statements

Order By: Relevance

Paper Sections

Select...

Some Notes On Turing Degrees Of Low Ce Sets2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, there is a c.e. set 𝑊 such that 𝑊 ≢ 𝑇 𝐴 ⊕ 𝐵 for all superlow sets 𝐴 and 𝐵 [9,15,16]. Downey, Greenberg, and Weber [8] proved that the low c.e.…”

Section: Some Notes On Turing Degrees Of Low Ce Setsmentioning

confidence: 99%

See 1 more Smart Citation

A classification of low c.e. sets and the Ershov hierarchy

Faizrahmanov

2023

Mathematical Logic Qtrly

View full text Add to dashboard Cite

In this paper, we prove several results about the Turing jumps of low c.e. sets. We show that only Δ‐levels of the Ershov Hierarchy can properly contain the Turing jumps of c.e. sets and that there exists an arbitrarily large computable ordinal with a normal notation such that the corresponding Δ‐level is proper for the Turing jump of some c.e. set. Next, we generalize the notion of jump traceability to the jump traceability with ‐ and ‐bound for every infinite computable ordinal α. It is known that jump traceability and superlowness coincide on the c.e. sets and we show that for every infinite computable ordinal α, jump traceability with ‐ or ‐bound of a c.e. set A is equivalent to the fact that . Finally, we consider the generalized truth‐table reducibilities and prove that for every (not necessarily the Turing jump of a c.e. set) set A and every limit computable ordinal α, iff .

show abstract

“…Moreover, there is a c.e. set 𝑊 such that 𝑊 ≢ 𝑇 𝐴 ⊕ 𝐵 for all superlow sets 𝐴 and 𝐵 [9,15,16]. Downey, Greenberg, and Weber [8] proved that the low c.e.…”

Section: Some Notes On Turing Degrees Of Low Ce Setsmentioning

confidence: 99%

“…Moreover, there is a c.e. set W such that