Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
LaForte, Geoff - Department of Computer Science, University of West Florida
Isolation in higher degree types Geoffrey LaForte
2 set with barely \Sigma 0 2 degree \Lambda
Computably Enumerable Sets and Quasireducibility \Lambda
Why Gdel's Theorem Cannot Refute Computationalism
Relative enumerability in the difference hierarchy \Lambda Marat M. Arslanov 1 , Geoffrey L. LaForte,
Presentations of computably enumerable reals Rodney G. Downey and Geo rey L. LaForte
The isolated d.r.e degrees are dense in the r.e. Geoffrey LaForte
The isolated d.r.e degrees are dense in the r.e. degrees
Computably Enumerable Sets and Quasi-reducibility*
Decomposition and in ma in the computably enumerable degrees
A 02 set with barely 02 degree* Rod Downey, Geoffrey LaForte, Steffen Lempp
Completing pseudojump operators R. Coles, R. Downey, C. Jockusch, and G. LaForte
Decomposition and infima in the computably enumerable degrees
Isolation in higher degree types Geoffrey LaForte
