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

DOI10.1002/malq.202300020OpenAlexW4386604107MaRDI QIDQ6140757

M. Kh. Fajzrakhmanov

Publication date: 2 January 2024

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.202300020

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy
• A semilattice generated by superlow computably enumerable degrees
• Turing jumps in the Ershov hierarchy
• Relative enumerability in Ershov's hierarchy
• On a hierarchy of sets. III
• On the degrees less than 0'
• Splitting into degrees with low computational strength
• Turing and enumeration jumps in the Ershov hierarchy
• A Refinement of Lown and Highn for the R.E. Degrees
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Δ 2 0 -Mengen
• Some Notes on Degree Spectra of the Structures
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• On notation for ordinal numbers
• Theory and Applications of Models of Computation

This page was built for publication: A classification of low c.e. sets and the Ershov hierarchy