The possible Turing degree of the nonzero member in a two element degree spectrum

DOI10.1016/0168-0072(93)90190-OzbMath0773.03027OpenAlexW2032686575MaRDI QIDQ1210135

Valentina S. Harizanov

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90190-o

zbMATH Keywords

Turing degreesdegree spectrumrecursive modelintrinsically recursive relationrecursive family of r.e. sets

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57)

Related Items (13)

Degree spectra and computable dimensions in algebraic structures ⋮ Degree spectra of relations on structures of finite computable dimension ⋮ Finite computable dimension and degrees of categoricity ⋮ Freely generated projective planes with finite computable dimension ⋮ Degree Spectra of Relations on a Cone ⋮ Degree spectra of intrinsically c.e. relations ⋮ The Complexity of intrinsically r.e. subsets of existentially decidable models ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Prime models of finite computable dimension ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Degree Spectra of Relations on Computable Structures ⋮ Generalised weak presentations

Cites Work

• Unnamed Item
• Unnamed Item
• Computable single-valued numerations
• Stability of recursive structures in arithmetical degrees
• Problem of the number of non-self-equivalent constructivizations
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Uncountable degree spectra

This page was built for publication: The possible Turing degree of the nonzero member in a two element degree spectrum