The following pages link to Charles M. Harris (Q412059):
Displayed 14 items.
- Badness and jump inversion in the enumeration degrees (Q412060) (← links)
- Goodness in the enumeration and singleton degrees (Q992037) (← links)
- Enumeration 1-genericity in the local enumeration degrees (Q1633891) (← links)
- Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064) (← links)
- On the symmetric enumeration degrees (Q2472608) (← links)
- An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees (Q2898073) (← links)
- Non-cuppable enumeration degrees via finite injury (Q2907057) (← links)
- Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211) (← links)
- On the jump classes of noncuppable enumeration degrees (Q3083133) (← links)
- On limitwise monotonicity and maximal block functions (Q3195647) (← links)
- Linearisations and the Ershov hierarchy (Q4683149) (← links)
- On Maximal Block Functions of Computable η-like Linear Orderings (Q5175893) (← links)
- New Computational Paradigms (Q5717039) (← links)
- Logical Approaches to Computational Barriers (Q5898819) (← links)