Reductions between types of numberings
From MaRDI portal
Recommendations
Cites work
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- A Splitting Theorem for the N-R.E. Degrees
- Algorithmic randomness and complexity.
- Anti-complex sets and reducibilities with tiny use
- Arithmetic complexity via effective names for random sequences
- Arithmetical m-degrees
- Benign cost functions and lowness properties
- Classical recursion theory. The theory of functions and sets of natural numbers
- Computability and randomness
- Computable single-valued numerations
- Computable structures and the hyperarithmetical hierarchy
- Demuth randomness and computational complexity
- Families without minimal numberings
- Generalized computable numerations and nontrivial Rogers semilattices
- scientific article; zbMATH DE number 3863176 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3467059 (Why is no real title available?)
- scientific article; zbMATH DE number 2167508 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- scientific article; zbMATH DE number 3342830 (Why is no real title available?)
- scientific article; zbMATH DE number 3342831 (Why is no real title available?)
- Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy
- Numberings and randomness
- On some examples of upper semilattices of computable enumerations
- On the existence of universal numberings for finite families of d.c.e. sets
- Positive enumerations
- Positive undecidable numberings in the Ershov hierarchy
- Post's Programme for the Ershov Hierarchy
- Recursive Pseudo-Well-Orderings
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- Things that can be made into themselves
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Turing degrees and the Ershov hierarchy
- Working with strong reducibilities above totally -c.e. and array computable degrees
Cited in
(17)- Elementary theories and hereditary undecidability for semilattices of numberings
- Strong reducibility of partial numberings
- Theories of Rogers semilattices of analytical numberings
- One-element Rogers semilattices in the Ershov hierarchy
- Bounded reducibility for computable numberings
- On universal pairs in the Ershov hierarchy
- Rogers semilattices with least and greatest elements in the Ershov hierarchy
- scientific article; zbMATH DE number 3863189 (Why is no real title available?)
- Rogers semilattices of punctual numberings
- Rogers semilattices of limitwise monotonic numberings
- How to approximate fuzzy sets: mind-changes and the Ershov hierarchy
- On cardinalities of Rogers semilattices for families in the Ershov hierarchy
- Fixed point theorems for minimal numberings
- On infinite direct sums of minimal numberings of functional families
- Continuity theorems for a class of computable operators
- Computably enumerable sets of reals in constructive mathematical analysis
- Numberings in the analytical hierarchy
This page was built for publication: Reductions between types of numberings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326424)
