Arithmetical Reducibilities I
From MaRDI portal
Cited in
(33)- The jump operator on the \(\omega \)-enumeration degrees
- Hard promise problems and nonuniform complexity
- Density of the cototal enumeration degrees
- Coding and definability in computable structures
- Fragments of the theory of the enumeration degrees
- Characterizing the continuous degrees
- Genericity of weakly computable objects
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
- Randomness for non-computable measures
- Rice sequences of relations
- Enumeration reducibility and computable structure theory
- Reducibility on families
- Regular enumerations
- Cototal enumeration degrees and their applications to effective mathematics
- About the domino problem for subshifts on groups
- On cototality and the skip operator in the enumeration degrees
- Measuring complexities of classes of structures
- Relationships between computability-theoretic properties of problems
- A structural dichotomy in the enumeration degrees
- scientific article; zbMATH DE number 7092101 (Why is no real title available?)
- Degrees of unsolvability of continuous functions
- Relatively computably enumerable reals
- The enumeration degrees: local and global structural interactions
- Defining totality in the enumeration degrees
- Point Degree Spectra of Represented Spaces
- Strong computable type
- The relationship between local and global structure in the enumeration degrees
- PA RELATIVE TO AN ENUMERATION ORACLE
- Strong minimal pairs in the enumeration degrees
- Ivan Soskov: a life in computability
- Relations enumerable from positive information
- Enumerations and completely decomposable torsion-free abelian groups
- The jump operation for structure degrees
This page was built for publication: Arithmetical Reducibilities I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636865)
