Pages that link to "Item:Q1430995"

The following pages link to Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995):

Displaying 18 items.

• Computable structures and the hyperarithmetical hierarchy (Q1572657) (← links)
• Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
• A computational glimpse at the Leibniz and Frege hierarchies (Q1676326) (← links)
• Degrees of categoricity and the hyperarithmetic hierarchy (Q1949167) (← links)
• Degree spectra of structures relative to equivalences (Q2011365) (← links)
• Degree spectra of intrinsically c. e. relations (Q2747697) (← links)
• The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
• Relative to any non-hyperarithmetic set (Q2853977) (← links)
• Strength and Weakness in Computable Structure Theory (Q2970966) (← links)
• The natural hierarchy and quasi-hierarchy of constructibility degrees (Q3026997) (← links)
• On the orbits of computably enumerable sets (Q3058264) (← links)
• Degree Spectra of Relations on Computable Structures (Q4508282) (← links)
• ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES (Q5021936) (← links)
• Degrees of categoricity of trees and the isomorphism problem (Q5108865) (← links)
• The property “arithmetic-is-recursive” on a cone (Q5163171) (← links)
• Π₁⁰ classes and strong degree spectra of relations (Q5422314) (← links)
• Tree-Automatic Well-Founded Trees (Q5891703) (← links)