Δ 2 0 -Mengen
From MaRDI portal
Publication:4128807
DOI10.1007/BF02007257zbMath0356.02039MaRDI QIDQ4128807
Publication date: 1976
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137927
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
03D55: Hierarchies of computability and definability
Related Items
Weakly computable real numbers, 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, Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees, Degrees of enumerations of countable Wehner-like families, \textit{CEA} operators and the ershov hierarchy
Cites Work