The Ershov hierarchy
From MaRDI portal
Publication:2906563
zbMATH Open1279.03067MaRDI QIDQ2906563FDOQ2906563
Publication date: 5 September 2012
Recommendations
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)
Cited In (19)
- Definability and elementary equivalence in the Ershov difference hierarchy
- On universal pairs in the Ershov hierarchy
- Strongly \(\eta \)-representable degrees and limitwise monotonic functions
- Turing jumps in the Ershov hierarchy
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
- \textit{CEA} operators and the ershov hierarchy
- Equivalence structures and isomorphisms in the difference hierarchy
- A classification of low c.e. sets and the Ershov hierarchy
- Theory and Applications of Models of Computation
- Definable relations in Turing degree structures
- Post's Programme for the Ershov Hierarchy
- Marat Mirzaevich Arslanov (on his eightieth birthday)
- Properties of numberings in various levels of the Ershov hierarchy
- Normalizing notations in the Ershov hierarchy
- A conjecture of Ershov for a relative hierarchy fails near \({\mathcal O}\)
- Relative enumerability in Ershov's hierarchy
- Weak density and nondensity among transfinite levels of the Ershov hierarchy
- Ershov hierarchy
- Hierarchy of limiting computations
This page was built for publication: The Ershov hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906563)