A conjecture of Ershov for a relative hierarchy fails near O

DOI10.1007/BF01978670MaRDI QIDQ796522zbMATH OpenWikidataFDO

Authors Jeanleah Mohrherr

Publication date 1983

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

Full work available at URL https://doi.org/10.1007/BF01978670

zbMATH Keywords

Kleene's 0Relativizationtransfinite difference hierarchy

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Review text

Significant properties, of the transfinite difference hierarchy based on recursively enumerable sets, were developed in work of Yu. L. Ershov. Relativization of the hierarchy is a natural topic and, in addition to the obvious means of relativization, Ershov conjectured that two weak relativizations may be equivalent to full relativization. The paper being reviewed refutes one of these conjectures.

Recommendations

• The Ershov hierarchy
• Ershov hierarchy
• Turing degrees and the Ershov hierarchy
• Relative enumerability in Ershov's hierarchy
• Definability and elementary equivalence in the Ershov difference hierarchy

Cited in

(4)

• Ershov hierarchy
• Relative enumerability in Ershov's hierarchy
• scientific article; zbMATH DE number 1396725 (Why is no real title available?)
• The order conjecture fails in S

This page was built for publication: A conjecture of Ershov for a relative hierarchy fails near \({\mathcal O}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796522)