Pages that link to "Item:Q3797173"
From MaRDI portal
The following pages link to Hyperarithmetical Index Sets in Recursion Theory (Q3797173):
Displayed 14 items.
- An effective analysis of the Denjoy rank (Q778729) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Index sets of classes of hyper-hypersimple sets (Q1174056) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Coding in the partial order of enumerable sets (Q1380333) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Discrete families of recursive functions and index sets (Q1842381) (← links)
- \(\Sigma_ 5\)-completeness of index sets arising from the recursively enumerable Turing degrees (Q1919542) (← links)
- \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets (Q1919553) (← links)
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs (Q1926591) (← links)
- A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK (Q2921032) (← links)
- Rice’s Theorem in Effectively Enumerable Topological Spaces (Q3195700) (← links)