The Isolated D. R. E. Degrees are Dense in the R. E. Degrees. - Geoffrey LaForte (Math. Log. Q., 1996)

Why Gödel's Theorem Cannot Refute Computationalism. - Geoffrey LaForte; Patrick J. Hayes; Kenneth M. Ford (Artif. Intell., 1998)

Computably Enumerable Sets and Quasi-Reducibility. - Rodney G. Downey; Geoffrey LaForte; André Nies (Ann. Pure Appl. Log., 1998)

Relative Enumerability in the Difference Hierarchy. - Marat M. Arslanov; Geoffrey LaForte; Theodore A. Slaman (J. Symb. Log., 1998)

Addendum to "Computably Enumerable Sets and Quasi-Reducibility". - Rodney G. Downey; Geoffrey LaForte; André Nies (Ann. Pure Appl. Log., 1999)

A Delta02 Set With Barely Sigma02 Degree. - Rodney G. Downey; Geoffrey LaForte; Steffen Lempp (J. Symb. Log., 1999)

Presentations of computably enumerable reals. - Rodney G. Downey; Geoffrey LaForte (Theor. Comput. Sci., 2002)

Decomposition and infima in the computably enumerable degrees. - Rodney G. Downey; Geoffrey LaForte; Richard A. Shore (J. Symb. Log., 2003)

Randomness and reducibility. - Rodney G. Downey; Denis R. Hirschfeldt; Geoffrey LaForte (J. Comput. Syst. Sci., 2004)

On Schnorr and computable randomness, martingales, and machines. - Rod Downey; Evan J. Griffiths; Geoffrey LaForte (Math. Log. Q., 2004)

Isolation in the CEA hierarchy. - Geoffrey LaForte (Arch. Math. Log., 2005)

Completing pseudojump operators. - Richard Coles; Rodney G. Downey; Carl G. Jockusch Jr.; Geoffrey LaForte (Ann. Pure Appl. Log., 2005)

Pseudojump Operators and P01 Classes. - Douglas A. Cenzer; Geoffrey LaForte; Guohua Wu (CiE, 2007)

Undecidability of the structure of the Solovay degrees of c.e. reals. - Rodney G. Downey; Denis R. Hirschfeldt; Geoffrey LaForte (J. Comput. Syst. Sci., 2007)

Equivalence structures and isomorphisms in the difference hierarchy. - Douglas Cenzer; Geoffrey LaForte; Jeffrey B. Remmel (J. Symb. Log., 2009)

Pseudojumps and Pi10 Classes. - Douglas A. Cenzer; Geoffrey LaForte; Guohua Wu (J. Log. Comput., 2009)