Possible degrees in recursive copies. II
From MaRDI portal
Publication:1368584
DOI10.1016/S0168-0072(96)00026-7zbMath0877.03022MaRDI QIDQ1368584
Publication date: 8 December 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
03D30: Other degrees and reducibilities in computability and recursion theory
03D45: Theory of numerations, effectively presented structures
Related Items
Sequences of n-diagrams, Π11 relations and paths through, Coding a family of sets, Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures, Generalised weak presentations
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