Degrees in Which the Recursive Sets are Uniformly Recursive
From MaRDI portal
Cited in
(47)- Upper bounds for the arithmetical degrees
- Automorphism bases for degrees of unsolvability
- Splitting theorems in recursion theory
- Extremes in the degrees of inferability
- Learning how to separate.
- Classes bounded by incomplete sets
- Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
- Universal generalized computable numberings and hyperimmunity
- Degree spectra of real closed fields
- Weakly useful sequences
- Equivalences between learning of data and probability distributions, and their applications
- Computable analogs of cardinal characteristics: prediction and rearrangement
- Degree spectra of structures
- Khutoretskii's theorem for generalized computable families
- Spectrum of the field of computable real numbers
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
- Minimal generalized computable numberings and families of positive preorders
- Asymptotic density and the coarse computability bound
- Learning families of closed sets in matroids
- Automorphisms of -like computable linear orderings and Kierstead's conjecture
- Controlling iterated jumps of solutions to combinatorial problems
- Degrees joining to 0′
- The upper semilattice of degrees ≤ 0′ is complemented
- Wtt-degrees and T-degrees of r.e. sets
- Two theorems on degrees of models of true arithmetic
- T-Degrees, Jump Classes, and Strong Reducibilities
- European Summer Meeting of the Association for Symbolic Logic, Leeds, 1979
- Strong reducibilities
- A Completely Mitotic Nonrecursive R.E. Degree
- Recursively enumerable sets and degrees
- A cohesive set which is not high
- Reducibility on families
- Weakly useful sequences
- Degree theoretic definitions of the low2 recursively enumerable sets
- A characterization of the \(0\)-basis homogeneous bounding degrees
- Generic Muchnik reducibility and presentations of fields
- Degrees of sets having no subsets of higher m- and t t-degree
- Robust learning with infinite additional information
- Embeddings of N₅ and the contiguous degrees
- Numberings, c.e. oracles, and fixed points
- Extremal numberings and fixed point theorems
- MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
- Families of permutations and ideals of Turing degrees
- Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
- On Non-principal Arithmetical Numberings and Families
- Some properties of precompletely and positively numbered sets
- Title not available (Why is no real title available?)
This page was built for publication: Degrees in Which the Recursive Sets are Uniformly Recursive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625139)
