Some effects of Ash-Nerode and other decidability conditions on degree spectra
From MaRDI portal
Publication:1182431
DOI10.1016/0168-0072(91)90097-6zbMath0756.03022OpenAlexW1975720205MaRDI QIDQ1182431
Publication date: 28 June 1992
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(91)90097-6
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (21)
Possible degrees in recursive copies ⋮ Π11 relations and paths through ⋮ Quasi-simple relations in copies of a given recursive structure ⋮ Permitting, forcing, and copying of a given recursive relation ⋮ Possible degrees in recursive copies. II ⋮ Freely generated projective planes with finite computable dimension ⋮ Turing degrees of hypersimple relations on computable structures ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Degree Spectra of Relations on a Cone ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ The possible Turing degree of the nonzero member in a two element degree spectrum ⋮ Π10 classes and strong degree spectra of relations ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Degree spectra of the successor relation of computable linear orderings ⋮ ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS ⋮ Turing degrees of certain isomorphic images of computable relations ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Coding a family of sets ⋮ Degree Spectra of Relations on Computable Structures ⋮ Degree spectra of relations on computable structures in the presence of Δ20isomorphisms ⋮ Generalised weak presentations
Cites Work
This page was built for publication: Some effects of Ash-Nerode and other decidability conditions on degree spectra