Positive undecidable numberings in the Ershov hierarchy

DOI10.1007/S10469-012-9162-0zbMath1287.03092OpenAlexW2033860122MaRDI QIDQ695803

Manat Mustafa, Andrea Sorbi

Publication date: 17 December 2012

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: http://nur.nu.edu.kz/handle/123456789/971

zbMATH Keywords

Ershov hierarchycomputable ordinalsfamilies of \(\Sigma^{-1}_a\) setspositive numberingsRogers reducibility

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items (7)

The branching theorem and computable categoricity in the Ershov hierarchy ⋮ Rogers semilattices with least and greatest elements in the Ershov hierarchy ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ Rogers semilattices for families of equivalence relations in the Ershov hierarchy ⋮ Reductions between types of numberings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive undecidable numberings in the Ershov hierarchy