Charles M. Harris

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

Enumeration 1-Genericity in the Local Enumeration Degrees.

Liliana Badillo, Charles M. Harris, Mariya Ivanova Soskova

Notre Dame J. Formal Log., 2018

Linearisations and the Ershov hierarchy.

S. Barry Cooper, James Gay, Charles M. Harris, Kyung Il Lee, Anthony Morphett

Comput., 2018

2016

Automorphisms of <i>η</i>-like computable linear orderings and Kierstead's conjecture.

Charles M. Harris, Kyung Il Lee, S. Barry Cooper

Math. Log. Q., 2016

2015

On limitwise monotonicity and maximal block functions.

Charles M. Harris

Comput., 2015

2014

Avoiding uniformity in the Δ₂⁰ enumeration degrees.

Liliana Badillo, Charles M. Harris

Ann. Pure Appl. Log., 2014

On Maximal Block Functions of Computable η-like Linear Orderings.

Charles M. Harris

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2012

Non-cuppable enumeration degrees via finite injury.

Charles M. Harris

J. Log. Comput., 2012

Badness and jump inversion in the enumeration degrees.

Charles M. Harris

Arch. Math. Log., 2012

An Application of 1-Genericity in the $\Pi^0_2$ Enumeration Degrees.

Liliana Badillo, Charles M. Harris

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

On the jump classes of noncuppable enumeration degrees.

Charles M. Harris

J. Symb. Log., 2011

2010

Goodness in the enumeration and singleton degrees.

Charles M. Harris

Arch. Math. Log., 2010

2007

On the Symmetric Enumeration Degrees.

Charles M. Harris

Notre Dame J. Formal Log., 2007

2006

Enumeration Reducibility with Polynomial Time Bounds.

Charles M. Harris

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Symmetric Enumeration Reducibility.

Charles M. Harris

Proceedings of the New Computational Paradigms, 2005