The Slaman-Wehner theorem in higher recursion theory

DOI10.1090/S0002-9939-2010-10693-7zbMath1237.03020MaRDI QIDQ3003597

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

Publication date: 27 May 2011

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

computable structureconstructible setalmost computable structuredegree spectrum of a structure

Mathematics Subject Classification ID

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

Related Items (4)

A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Degrees of enumerations of countable Wehner-like families ⋮ RELATIVE TO ANY NON-HYPERARITHMETIC SET

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerations in computable structure theory
• Degree spectra and immunity properties
• Degrees coded in jumps of orderings
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Degrees of Structures
• Some Notes on Degree Spectra of the Structures

This page was built for publication: The Slaman-Wehner theorem in higher recursion theory