Charles Harris

Enumeration 1-Genericity in the Local Enumeration Degrees
Liliana Badillo, Charles Harris and Mariya Soskova
Submitted April 2015  |  PDF

Automorphisms of η-like Computable Linear Orderings and Kierstead's Conjecture
Charles Harris, Kyung Il Lee and S. Barry Cooper
Accepted for publication in Mathematical Logic Quarterly  |  PDF

On Limitwise Monotonicity and Maximal Block Functions
Computability, Volume 4, pages 119-139, 2015  |  PDF

Avoiding Uniformity in the Δ₂ Enumeration Degrees
Liliana Badillo and Charles Harris
Annals of Pure and Applied Logic, Volume 165, pages 1355-1379, 2014  |  PDF

Badness and Jump Inversion in the Enumeration Degrees
Archive For Mathematical Logic, Volume 51 (Issue 3), pages 373-406, 2012  |  PDF

Noncuppable Enumeration Degrees via Finite Injury
Journal of Logic and Computation, Volume 22 (Issue 4), pages 807-829, 2012  |  PDF

On the Jump Classes of Noncuppable Enumeration Degrees
Journal of Symbolic Logic, Volume 76 (Issue 1), pages 177-197, 2011  |  PDF

Goodness in the Enumeration and Singleton Degrees
Archive For Mathematical Logic, Volume 49 (Issue 6), pages 673-691, 2010  |  PDF

On the Symmetric Enumeration Degrees
Notre Dame Journal of Formal Logic, Volume 48 (Issue 2), pages 175-204, 2007  |  PDF

On Maximal Block Functions of Computable η-like Linear Orderings
10th Conference on Computability in Europe, CiE 2014, Budapest
Springer LNCS, Volume 8493, pages 214-223, 2014  |  PDF

An Application of 1-Genericity in the Π₂ Enumeration Degrees
Liliana Badillo and Charles Harris
9th Annual Conference on Theory and Applications of Models of Computation, TAMC 2012, Beijing
Springer LNCS, Volume 7287, pages 604-620, 2012  |  PDF

Enumeration Reducibility with Polynomial Time Bounds
2nd Conference on Computatility in Europe, CiE 2006 Swansea
Springer LNCS, Volume 3988, pages 209-220, 2006  |  PDF

Symmetric Enumeration Reducibility
1st Conference on Computatility in Europe, CiE 2005, Amsterdam
Springer LNCS, Volume 3526, pages 196-208, 2005  |  PDF

Enumeration Reducibility and Polynomial Time Bounds
University of Leeds, 2006  |  PDF