Possible degrees in recursive copies

DOI10.1016/0168-0072(94)00043-3zbMath0837.03036OpenAlexW4213261045MaRDI QIDQ1902615

C. J. Ash, Julia F. Knight

Publication date: 13 May 1996

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00043-3

zbMATH Keywords

recursive structureTuring degreesisomorphic structuresdegree spectrarecursive copy

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (6)

Π₁¹ relations and paths through ⋮ Possible degrees in recursive copies. II ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Degree Spectra of Relations on a Cone ⋮ Coding a family of sets ⋮ Generalised weak presentations

Cites Work

• Unnamed Item
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Ramified systems
• On Suborderings of Degrees of Recursive Unsolvability

This page was built for publication: Possible degrees in recursive copies