The following pages link to On a hierarchy of sets. III (Q2551104):
Displaying 34 items.
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy (Q542199) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- Turing degrees in refinements of the arithmetical hierarchy (Q1757652) (← links)
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees (Q1919759) (← links)
- Properties of numberings in various levels of the Ershov hierarchy (Q1948664) (← links)
- Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering (Q1948665) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Asymptotic density and computability (Q2066410) (← links)
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy (Q2148810) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- On universal pairs in the Ershov hierarchy (Q2221958) (← links)
- \textit{CEA} operators and the ershov hierarchy (Q2234455) (← links)
- A survey of results on the d.c.e. and \(n\)-c.e. degrees (Q2263110) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Families without minimal numberings (Q2342320) (← links)
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees (Q2361673) (← links)
- A bounded jump for the bounded Turing degrees (Q2452680) (← links)
- Random reals à la Chaitin with or without prefix-freeness (Q2456371) (← links)
- THE n-r.e. DEGREES: UNDECIDABILITY AND Σ<sub>1</sub> SUBSTRUCTURES (Q2909622) (← links)
- Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
- A Survey of Results on the d-c.e. and n-c.e. Degrees (Q2970973) (← links)
- Nondensity of Double Bubbles in the D.C.E. Degrees (Q2970979) (← links)
- Rice and Rice-Shapiro Theorems for transfinite correction grammars (Q3096086) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- Learning correction grammars (Q3630576) (← links)
- Asymptotic density and the Ershov hierarchy (Q5258480) (← links)
- On the hierarchies of Δ<sub>2</sub><sup>0</sup>-real numbers (Q5444099) (← links)
- TRIAL AND ERROR MATHEMATICS II: DIALECTICAL SETS AND QUASIDIALECTICAL SETS, THEIR DEGREES, AND THEIR DISTRIBUTION WITHIN THE CLASS OF LIMIT SETS (Q5737944) (← links)
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings (Q5741390) (← links)
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5899647) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)
- A classification of low c.e. sets and the Ershov hierarchy (Q6140757) (← links)
