Arithmetical Reducibilities I
From MaRDI portal
Publication:5636865
DOI10.1002/malq.19710170139zbMath0229.02037OpenAlexW2096484781MaRDI QIDQ5636865
Publication date: 1971
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19710170139
Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)
Related Items
The jump operation for structure degrees, Genericity of weakly computable objects, Degrees of unsolvability of continuous functions, RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS, Cototal enumeration degrees and their applications to effective mathematics, Unnamed Item, A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES, Rice sequences of relations, Strong computable type, The enumeration degrees: Local and global structural interactions, The relationship between local and global structure in the enumeration degrees, PA RELATIVE TO AN ENUMERATION ORACLE, Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees, Reducibility on families, Enumeration Reducibility and Computable Structure Theory, Density of the cototal enumeration degrees, About the Domino Problem for Subshifts on Groups, Measuring complexities of classes of structures, Relatively computably enumerable reals, Defining totality in the enumeration degrees, Fragments of the theory of the enumeration degrees, Coding and definability in computable structures, Characterizing the continuous degrees, Enumerations and completely decomposable torsion-free abelian groups, On cototality and the skip operator in the enumeration degrees, Hard promise problems and nonuniform complexity, Regular enumerations, The jump operator on the \(\omega \)-enumeration degrees, Randomness for non-computable measures, Point Degree Spectra of Represented Spaces
