Turing degrees of certain isomorphic images of computable relations
From MaRDI portal
Recommendations
- Turing degrees of hypersimple relations on computable structures
- On relative enumerability of Turing degrees
- Isomorphism relations on computable structures
- Turing computable embeddings of equivalences other than isomorphism
- Turing degrees of isomorphism types of algebraic objects
- Amenable equivalence relations and Turing degrees
- Turing degrees and the Ershov hierarchy
- Definable relations in Turing degree structures
- Definable relations in Turing degree structures
- Turing degrees in refinements of the arithmetical hierarchy
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3732033 (Why is no real title available?)
- scientific article; zbMATH DE number 3732038 (Why is no real title available?)
- scientific article; zbMATH DE number 749928 (Why is no real title available?)
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Permitting, forcing, and copying of a given recursive relation
- Quasi-simple relations in copies of a given recursive structure
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Recursive Structures and Ershov's Hierarchy
- Semirecursive Sets and Positive Reducibility
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- Uncountable degree spectra
Cited in
(17)- The definability strength of combinatorial principles
- Degree spectra of relations on computable structures in the presence of Δ20isomorphisms
- A note on joins and meets for positive linear preorders
- Domination, forcing, array nonrecursiveness and relative recursive enumerability
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- On dark computably enumerable equivalence relations
- Turing degrees of hypersimple relations on computable structures
- Degree Spectra of Relations on Computable Structures
- Degree spectra of relations on structures of finite computable dimension
- Possible degrees in recursive copies
- Computable reducibility for computable linear orders of type \(\omega \)
- On learning families of ideals in lattices and Boolean algebras
- Bounding non-GL2 and R.E.A.
- Turing degrees of isomorphism types of algebraic objects
- On learning down-sets in quasi-orders, and ideals in Boolean algebras
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Π10 classes and strong degree spectra of relations
This page was built for publication: Turing degrees of certain isomorphic images of computable relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295383)
