Post's Programme for the Ershov Hierarchy

DOI10.1093/logcom/exm032zbMath1136.03028OpenAlexW2067836543MaRDI QIDQ5441119

S. Barry Cooper, Bahareh Afshari, George Barmpalias, Frank Stephan

Publication date: 7 February 2008

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:d27b453e-685c-4fef-844c-cf26ba7648f8

zbMATH Keywords

Ershov hierarchyenumerable setscohesiveness, immunity propertiesTuring degrees, wtt-degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees, Extending and interpreting Post's programme, A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES, 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10, Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees, Index sets and universal numberings, Hierarchy of Computably Enumerable Degrees II, Reductions between types of numberings