scientific article; zbMATH DE number 3342831

From MaRDI portal
Publication:5619077

zbMath0216.00902MaRDI QIDQ5619077

Yuri L. Ershov

Publication date: 1968

Full work available at URL: https://eudml.org/doc/186717

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (68)

Abstract complexity theory and the \(\Delta_{2}^{0}\) degreesHierarchy of limiting computationsElementary theories and structural properties of d-c.e. and n-c.e. degreesNonlowness is independent from ficklenessEmbeddability of the semilattice \(L_m^0\) in Rogers semilatticesExpressibility in the elementary theory of recursively enumerable sets with realizability logicThere exists a maximal 3-c.e. enumeration degreeRogers semilattices of families of two embedded sets in the Ershov hierarchyApproximating approximate reasoning: fuzzy sets and the Ershov hierarchyTowards a descriptive set theory for domain-like structuresStructural properties of computable classes of contructive modelsTowards the Effective Descriptive Set TheoryErshov hierarchy and the T-jumpInterpolating \(d\)-r.e. and REA degrees between r.e. degreesThe branching theorem and computable categoricity in the Ershov hierarchyTuring reducibility in the fine hierarchyNormalizing notations in the Ershov hierarchyDescriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spacesTowards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degreesAutomorphisms ofη-like computable linear orderings and Kierstead's conjectureFixed-parameter decidability: Extending parameterized complexity analysisA classification of low c.e. sets and the Ershov hierarchyHierarchies of function classes defined by the first-value operatorClassifying equivalence relations in the Ershov hierarchyA Survey of Results on the d-c.e. and n-c.e. DegreesNondensity of Double Bubbles in the D.C.E. DegreesDecomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchyComplementing cappable degrees in the difference hierarchy.On universal pairs in the Ershov hierarchyAvoiding uniformity in the \(\Delta_2^0\) enumeration degreesWell-Quasi Orders and Hierarchy TheoryA HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES\textit{CEA} operators and the ershov hierarchyWeak density and nondensity among transfinite levels of the Ershov hierarchyDegree Spectra of Relations on a ConeComputable categoricity and the Ershov hierarchyTuring degrees in refinements of the arithmetical hierarchyTuring jumps in the Ershov hierarchyStrongly \(\eta \)-representable degrees and limitwise monotonic functionsPositive undecidable numberings in the Ershov hierarchyFriedberg numberings in the Ershov hierarchyIndex sets in 0'A survey of results on the d.c.e. and \(n\)-c.e. degreesThe limitations of cupping in the local structure of the enumeration degreesOn frequency-enumerable setsCompletely enumerated setsCompleteness in the arithmetical hierarchy and fixed pointsTuring computability: structural theoryPrecomplete numberingsRelative enumerability in Ershov's hierarchyModel-theoretic properties of Turing degrees in the Ershov difference hierarchyHierarchy of Computably Enumerable Degrees IIWeakly precomplete equivalence relations in the Ershov hierarchyRice and Rice-Shapiro Theorems for transfinite correction grammarsWadge Degrees ofω-Languages of Deterministic Turing MachinesRogers semilattices for families of equivalence relations in the Ershov hierarchyAsymptotic density and computabilityOn a hierarchy of sets. IIIComplete numerations with infinitely many singular elementsReductions between types of numberingsOn the finiteness of the recursive chromatic numberON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACESMaximality and collapse in the hierarchy of α-c.a. degreesFamilies without minimal numberingsHierarchies of hyperarithmetical sets and functionsIndex sets in the hyperarithmetical hierarchyComputability of Real NumbersErshov hierarchy




This page was built for publication: