The following pages link to (Q4934277):
Displayed 13 items.
- Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- The Medvedev lattice of computably closed sets (Q818514) (← links)
- Degrees of difficulty of generalized r.e. separating classes (Q926177) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- The upward closure of a perfect thin class (Q958485) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy (Q1935363) (← links)
- The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable (Q2655138) (← links)
- Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees (Q2750927) (← links)
- Invariance in ℰ* and ℰ_{Π} (Q3378462) (← links)
- Computable symbolic dynamics (Q3528142) (← links)
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals (Q5695769) (← links)