On a hierarchy of sets. III

DOI10.1007/BF02219847zbMath0233.02017OpenAlexW4250826358MaRDI QIDQ2551104

Yuri L. Ershov

Publication date: 1971

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

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

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Related Items (34)

Elementary theories and structural properties of d-c.e. and n-c.e. degrees ⋮ THE n-r.e. DEGREES: UNDECIDABILITY AND Σ₁ SUBSTRUCTURES ⋮ Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy ⋮ Program Size Complexity of Correction Grammars in the Ershov Hierarchy ⋮ Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ The branching theorem and computable categoricity in the Ershov hierarchy ⋮ A classification of low c.e. sets and the Ershov hierarchy ⋮ Properties of numberings in various levels of the Ershov hierarchy ⋮ Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ Strength and Weakness in Computable Structure Theory ⋮ A Survey of Results on the d-c.e. and n-c.e. Degrees ⋮ Nondensity of Double Bubbles in the D.C.E. Degrees ⋮ On universal pairs in the Ershov hierarchy ⋮ A bounded jump for the bounded Turing degrees ⋮ Random reals à la Chaitin with or without prefix-freeness ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ \textit{CEA} operators and the ershov hierarchy ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Turing degrees in refinements of the arithmetical hierarchy ⋮ TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS ⋮ Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings ⋮ A survey of results on the d.c.e. and \(n\)-c.e. degrees ⋮ On the hierarchies of Δ₂⁰-real numbers ⋮ Turing computability: structural theory ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Learning correction grammars ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ Asymptotic density and computability ⋮ ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES ⋮ Families without minimal numberings ⋮ Asymptotic density and the Ershov hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a hierarchy of sets. III