Permitting, forcing, and copying of a given recursive relation
From MaRDI portal
Let \(\mathcal A\) be a recursive structure for a language \(L\) and \(R\) be a relation on \(\mathcal A\). The authors give conditions under which this relation can be made \(\alpha\)-r.e. in Ershov's hierarchy of \(\Delta^0_2\)-sets in an appropriate recursive copy of \(\mathcal A\).
Recommendations
Cites work
- scientific article; zbMATH DE number 3732033 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Pairs of recursive structures
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- Uncountable degree spectra
Cited in
(10)- Turing degrees of certain isomorphic images of computable relations
- Computable isomorphisms, degree spectra of relations, and Scott families
- Quasi-simple relations in copies of a given recursive structure
- Possible degrees in recursive copies. II
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- Degree spectra of relations on structures of finite computable dimension
- Degree spectra of intrinsically c. e. relations
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- Degree Spectra of Relations on Computable Structures
- Π10 classes and strong degree spectra of relations
This page was built for publication: Permitting, forcing, and copying of a given recursive relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365246)