The following pages link to (Q4249723):
Displaying 39 items.
- Turing degrees of multidimensional SFTs (Q393140) (← links)
- Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes (Q579241) (← links)
- The complexity of recursive constraint satisfaction problems (Q636283) (← links)
- On degree-preserving homeomorphisms between trees in computable topology (Q926174) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- The upward closure of a perfect thin class (Q958485) (← links)
- Members of countable \(\Pi ^ 0_ 1\) classes (Q1084100) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Feasible graphs with standard universe (Q1295403) (← links)
- A blend of methods of recursion theory and topology. (Q1412834) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- \(\Pi_{1}^{0}\) classes and orderable groups (Q1612488) (← links)
- A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points (Q1762734) (← links)
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics (Q1776197) (← links)
- The random members of a \({\Pi }_{1}^{0}\) class (Q1787954) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees (Q2344718) (← links)
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions (Q2442153) (← links)
- Small \(\Pi^{0}_{1}\) classes (Q2491076) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← 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)
- choice classes (Q2958216) (← links)
- $\it \Pi^0_1$ Sets and Tilings (Q3010404) (← links)
- Computability in Symbolic Dynamics (Q3188248) (← links)
- Invariance in ℰ* and ℰ_{Π} (Q3378462) (← links)
- Computable symbolic dynamics (Q3528142) (← links)
- On Turing degrees of points in computable topology (Q3528143) (← links)
- Singular coverings and non‐uniform notions of closed set computability (Q3528149) (← links)
- Immunity for Closed Sets (Q3576043) (← links)
- <i>Π</i><sub>0</sub><sup>1</sup>-classes and Rado's selection principle (Q3984442) (← links)
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis (Q4916185) (← links)
- Singular Coverings and Non-Uniform Notions of Closed Set Computability (Q4918031) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- Random Continuous Functions (Q4921446) (← links)
- Computability of Subsets of Metric Spaces (Q5024568) (← links)
- Subshifts with sparse traces (Q5139041) (← links)
- COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
