default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeoffrey LaForte
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j15]Douglas Cenzer, Geoffrey LaForte, Jeffrey B. Remmel:
Equivalence structures and isomorphisms in the difference hierarchy. J. Symb. Log. 74(2): 535-556 (2009)- [j14]Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu:
Pseudojumps and Pi10 Classes. J. Log. Comput. 19(1): 77-87 (2009) - 2007
- [j13]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte:
Undecidability of the structure of the Solovay degrees of c.e. reals. J. Comput. Syst. Sci. 73(5): 769-787 (2007) - [c2]Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu:
Pseudojump Operators and P01 Classes. CiE 2007: 146-151 - 2005
- [j12]Geoffrey LaForte:
Isolation in the CEA hierarchy. Arch. Math. Log. 44(2): 227-244 (2005) - [j11]Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte:
Completing pseudojump operators. Ann. Pure Appl. Log. 136(3): 297-333 (2005) - 2004
- [j10]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte:
Randomness and reducibility. J. Comput. Syst. Sci. 68(1): 96-114 (2004) - [j9]Rod Downey, Evan J. Griffiths, Geoffrey LaForte:
On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50(6): 613-627 (2004) - 2003
- [j8]Rodney G. Downey, Geoffrey LaForte, Richard A. Shore:
Decomposition and infima in the computably enumerable degrees. J. Symb. Log. 68(2): 551-579 (2003) - 2002
- [j7]Rodney G. Downey, Geoffrey LaForte:
Presentations of computably enumerable reals. Theor. Comput. Sci. 284(2): 539-555 (2002) - 2001
- [c1]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte:
Randomness and Reducibility. MFCS 2001: 316-327
1990 – 1999
- 1999
- [j6]Rodney G. Downey, Geoffrey LaForte, André Nies:
Addendum to "Computably Enumerable Sets and Quasi-Reducibility". Ann. Pure Appl. Log. 98(1-3): 295 (1999) - [j5]Rodney G. Downey, Geoffrey LaForte, Steffen Lempp:
A Delta02 Set With Barely Sigma02 Degree. J. Symb. Log. 64(4): 1700-1718 (1999) - 1998
- [j4]Geoffrey LaForte, Patrick J. Hayes
, Kenneth M. Ford:
Why Gödel's Theorem Cannot Refute Computationalism. Artif. Intell. 104(1-2): 265-286 (1998) - [j3]Rodney G. Downey, Geoffrey LaForte, André Nies:
Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Log. 95(1-3): 1-35 (1998) - [j2]Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman:
Relative Enumerability in the Difference Hierarchy. J. Symb. Log. 63(2): 411-420 (1998) - 1996
- [j1]Geoffrey LaForte:
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees. Math. Log. Q. 42: 83-103 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-04 03:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
