Δ 2 0 -Mengen

DOI10.1007/BF02007257zbMath0356.02039OpenAlexW2316459924MaRDI QIDQ4128807

Hans-Georg Carstens

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (8)

Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees ⋮ A classification of low c.e. sets and the Ershov hierarchy ⋮ A semilattice generated by superlow computably enumerable degrees ⋮ \textit{CEA} operators and the ershov hierarchy ⋮ Weakly computable real numbers ⋮ Turing jumps in the Ershov hierarchy ⋮ Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy ⋮ Degrees of enumerations of countable Wehner-like families

Cites Work

• Unnamed Item
• Unnamed Item
• Nicht-Standardmodelle der Zahlentheorie
• Reducing hyperarithmetic sequences
• Π₁⁰ classes and Boolean combinations of recursively enumerable sets

This page was built for publication: Δ 2 0 -Mengen