Pages that link to "Item:Q1295383"

The following pages link to Turing degrees of certain isomorphic images of computable relations (Q1295383):

Displaying 18 items.

• The possible Turing degree of the nonzero member in a two element degree spectrum (Q1210135) (← links)
• Possible degrees in recursive copies. II (Q1368584) (← links)
• Turing degrees of hypersimple relations on computable structures (Q1399102) (← links)
• 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)
• Possible degrees in recursive copies (Q1902615) (← links)
• THE DEFINABILITY STRENGTH OF COMBINATORIAL PRINCIPLES (Q2976345) (← links)
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms (Q3149990) (← links)
• Bounding non-GL₂ and R.E.A. (Q3399188) (← links)
• Degree Spectra of Relations on Computable Structures (Q4508282) (← links)
• Turing degrees of isomorphism types of algebraic objects (Q5294135) (← links)
• Domination, forcing, array nonrecursiveness and relative recursive enumerability (Q5388717) (← links)
• Π₁⁰ 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)