Arithmetical Reducibilities I
From MaRDI portal
Publication:5636865
DOI10.1002/malq.19710170139zbMath0229.02037MaRDI 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
03D30: Other degrees and reducibilities in computability and recursion theory
03D55: Hierarchies of computability and definability
Related Items
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, Unnamed Item, Degrees of unsolvability of continuous functions, The enumeration degrees: Local and global structural interactions, Defining totality in the enumeration degrees, Reducibility on families, Measuring complexities of classes of structures, Relatively computably enumerable reals, Enumerations and completely decomposable torsion-free abelian groups, The jump operation for structure degrees, 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, 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
