A local version of the Slaman-Wehner theorem and families closed under finite differences
From MaRDI portal
Publication:6165007
DOI10.1215/00294527-10670074OpenAlexW4382405491WikidataQ121631443 ScholiaQ121631443MaRDI QIDQ6165007
Publication date: 28 July 2023
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1215/00294527-10670074
Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computable single-valued numerations
- Problem of the number of non-self-equivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- Limitwise monotonic spectra and their generalizations
- Enumerations in computable structure theory
- RELATIVE TO ANY NON-HYPERARITHMETIC SET
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Limitwise monotonic sets of reals