The following pages link to (Q4513973):
Displaying 9 items.
- Definable relations in Turing degree structures (Q468086) (← links)
- Definability in the structure of words with the inclusion relation (Q606049) (← links)
- Definability in the Turing degrees (Q1075320) (← links)
- On the problem of definability of the computably enumerable degrees in the difference hierarchy (Q1785041) (← links)
- Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees (Q1840456) (← links)
- On definable filters in computably enumerable degrees (Q2370372) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- On the definable ideal generated by nonbounding c.e. degrees (Q3370764) (← links)
- Definability in the Infix Order on Words (Q3637247) (← links)
