Pages that link to "Item:Q1295383"
From MaRDI portal
The following pages link to Turing degrees of certain isomorphic images of computable relations (Q1295383):
Displaying 13 items.
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- On dark computably enumerable equivalence relations (Q1642296) (← links)
- THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345) (← links)
- Degree spectra of relations on computable structures in the presence of Δ<sub>2</sub><sup>0</sup>isomorphisms (Q3149990) (← links)
- Bounding non-GL<sub>2</sub> and R.E.A. (Q3399188) (← links)
- Degree Spectra of Relations on Computable Structures (Q4508282) (← links)
- Domination, forcing, array nonrecursiveness and relative recursive enumerability (Q5388717) (← links)
- Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations (Q5422314) (← links)
- Computable reducibility for computable linear orders of type \(\omega \) (Q6187991) (← links)
- A note on joins and meets for positive linear preorders (Q6587349) (← links)
- On learning families of ideals in lattices and Boolean algebras (Q6636063) (← links)
- On learning down-sets in quasi-orders, and ideals in Boolean algebras (Q6661766) (← links)
