The following pages link to (Q4938557):
Displaying 11 items.
- Algebraic structures computable without delay (Q528478) (← links)
- Model-theoretic complexity of automatic structures (Q636281) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Degree spectra and computable dimensions in algebraic structures (Q1612482) (← links)
- Degree spectra of relations on structures of finite computable dimension (Q1612487) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- \(\mathsf{WKL}_0\) and induction principles in model theory (Q2344719) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Prime models of theories of computable linear orderings (Q2723507) (← links)
- Model Theoretic Complexity of Automatic Structures (Extended Abstract) (Q3502675) (← links)
- A structure of punctual dimension two (Q5111521) (← links)
