RELATIVE TO ANY NON-HYPERARITHMETIC SET

DOI10.1142/S0219061312500079zbMath1308.03050arXiv1110.1907MaRDI QIDQ2853977

Noam Greenberg, Theodore A. Slaman, Antonio Montalbán

Publication date: 17 October 2013

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.1907

zbMATH Keywords

computable structurehyperarithmeticdegree spectrum

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Related Items (13)

New degree spectra of Polish spaces ⋮ Uniformity results on the Baire property ⋮ On Decidable and Computable Models of Theories ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ A local version of the Slaman-Wehner theorem and families closed under finite differences ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Degree spectra of structures relative to equivalences ⋮ Degree spectra of structures ⋮ Spectra of theories and structures ⋮ An effective analysis of the Denjoy rank ⋮ Theory spectra and classes of theories ⋮ Continuous higher randomness ⋮ Limitwise monotonic spectra and their generalizations

Cites Work

• Pairs of recursive structures
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable structures and the hyperarithmetical hierarchy
• Enumerations in computable structure theory
• Spectra of highn and non-lown degrees
• The Slaman-Wehner theorem in higher recursion theory
• Computable trees, prime models, and relative decidability
• Degree spectra and immunity properties
• Spectra of degrees of some structures
• Recursively presentable prime models
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Recursive in a generic real

This page was built for publication: RELATIVE TO ANY NON-HYPERARITHMETIC SET