Charles M. Harris

According to our database1, Charles M. Harris authored at least 14 papers between 2005 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Enumeration 1-Genericity in the Local Enumeration Degrees.
Notre Dame J. Formal Log., 2018

Linearisations and the Ershov hierarchy.
Comput., 2018

2016
Automorphisms of <i>η</i>-like computable linear orderings and Kierstead's conjecture.
Math. Log. Q., 2016

2015
On limitwise monotonicity and maximal block functions.
Comput., 2015

2014
Avoiding uniformity in the Δ<sub>2</sub><sup>0</sup> enumeration degrees.
Ann. Pure Appl. Log., 2014

On Maximal Block Functions of Computable η-like Linear Orderings.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2012
Non-cuppable enumeration degrees via finite injury.
J. Log. Comput., 2012

Badness and jump inversion in the enumeration degrees.
Arch. Math. Log., 2012

An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2012

2011
On the jump classes of noncuppable enumeration degrees.
J. Symb. Log., 2011

2010
Goodness in the enumeration and singleton degrees.
Arch. Math. Log., 2010

2007
On the Symmetric Enumeration Degrees.
Notre Dame J. Formal Log., 2007

2006
Enumeration Reducibility with Polynomial Time Bounds.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Symmetric Enumeration Reducibility.
Proceedings of the New Computational Paradigms, 2005


  Loading...