Uncountable degree spectra

DOI10.1016/0168-0072(91)90049-RzbMath0744.03035MaRDI QIDQ1182483

Valentina S. Harizanov

Publication date: 28 June 1992

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

zbMATH Keywords

Turing degreesrecursive modelrecursive relationisomorphic images

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (10)

Permitting, forcing, and copying of a given recursive relation ⋮ Freely generated projective planes with finite computable dimension ⋮ Some effects of Ash-Nerode and other decidability conditions on degree spectra ⋮ The possible Turing degree of the nonzero member in a two element degree spectrum ⋮ Π₁⁰ classes and strong degree spectra of relations ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Computability of Fraïssé limits ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Turing degrees of certain isomorphic images of computable relations ⋮ Generalised weak presentations

Cites Work

• Stability of recursive structures in arithmetical degrees
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• Autostability and computable families of constructivizations
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Degrees coded in jumps of orderings
• ∏ 0 1 Classes and Degrees of Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uncountable degree spectra