Possible degrees in recursive copies. II

DOI10.1016/S0168-0072(96)00026-7zbMath0877.03022MaRDI QIDQ1368584

C. J. Ash, Julia F. Knight

Publication date: 8 December 1997

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

zbMATH Keywords

recursive copyrelation on a recursive structure

Mathematics Subject Classification ID

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

Related Items (7)

Π₁¹ relations and paths through ⋮ 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 ⋮ On decidability of amenability in computable groups ⋮ Generalised weak presentations ⋮ Sequences of n-diagrams

Cites Work

• Unnamed Item
• Recursive properties of relations on models
• Pairs of recursive structures
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Ramified systems
• Permitting, forcing, and copying of a given recursive relation
• Possible degrees in recursive copies
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Mixed systems

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