Geoffrey LaForte

According to our database1, Geoffrey LaForte authored at least 16 papers between 1996 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Pseudojumps and Pi<sub>1</sub><sup>0</sup> Classes.
J. Log. Comput., 2009

Equivalence structures and isomorphisms in the difference hierarchy.
J. Symb. Log., 2009

2007
Undecidability of the structure of the Solovay degrees of c.e. reals.
J. Comput. Syst. Sci., 2007

Pseudojump Operators and P<sup>0</sup><sub>1</sub> Classes.
Proceedings of the Computation and Logic in the Real World, 2007

2005
Completing pseudojump operators.
Ann. Pure Appl. Log., 2005

Isolation in the CEA hierarchy.
Arch. Math. Log., 2005

2004
On Schnorr and computable randomness, martingales, and machines.
Math. Log. Q., 2004

Randomness and reducibility.
J. Comput. Syst. Sci., 2004

2003
Decomposition and infima in the computably enumerable degrees.
J. Symb. Log., 2003

2002
Presentations of computably enumerable reals.
Theor. Comput. Sci., 2002

1999
A Delta<sup>0</sup><sub>2</sub> Set With Barely Sigma<sup>0</sup><sub>2</sub> Degree.
J. Symb. Log., 1999

Addendum to "Computably Enumerable Sets and Quasi-Reducibility".
Ann. Pure Appl. Log., 1999

1998
Relative Enumerability in the Difference Hierarchy.
J. Symb. Log., 1998

Computably Enumerable Sets and Quasi-Reducibility.
Ann. Pure Appl. Log., 1998

Why Gödel's Theorem Cannot Refute Computationalism.
Artif. Intell., 1998

1996
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.
Math. Log. Q., 1996


  Loading...