The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Leo Harrington: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yuri Gurevich, Leo Harrington
    Trees, Automata, and Games [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:60-65 [Conf]
  2. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
    The d.r.e. Degrees are Not Dense. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1991, v:55, n:2, pp:125-151 [Journal]
  3. Rodney G. Downey, Leo Harrington
    There is No Fat Orbit. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:80, n:3, pp:277-289 [Journal]
  4. Leo Harrington, Robert I. Soare
    Definable Properties of the Computably Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:97-125 [Journal]
  5. Peter Cholak, Leo Harrington
    Definable encodings in the computably enumerable sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2000, v:6, n:2, pp:185-196 [Journal]
  6. Leo Harrington, Robert I. Soare
    Definability, automorphisms, and dynamic properties of computably enumerable sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1996, v:2, n:2, pp:199-213 [Journal]
  7. Fred G. Abramson, Leo Harrington
    Models Without Indiscernibles. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:3, pp:572-600 [Journal]
  8. James E. Baumgartner, Leo Harrington, E. M. Kleinberg
    Adding a Closed Unbounded Set. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:2, pp:481-482 [Journal]
  9. Peter Cholak, Leo Harrington
    Isomorphisms of splits of computably enumerable sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2003, v:68, n:3, pp:1044-1064 [Journal]
  10. Solomon Feferman, Jon Barwise, Leo Harrington
    Meeting of the Association for Symbolic Logic: Reno, 1976. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1977, v:42, n:1, pp:156-160 [Journal]
  11. Leo Harrington
    Recursively Presentable Prime Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:2, pp:305-309 [Journal]
  12. Leo Harrington
    Analytic Determinacy and 0 #. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:4, pp:685-693 [Journal]
  13. Leo Harrington, Thomas Jech
    On sigma1 Well-Orderings of the Universe. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:167-170 [Journal]
  14. Leo Harrington, Alexander S. Kechris
    On Characterizing Spector Classes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1975, v:40, n:1, pp:19-24 [Journal]
  15. Leo Harrington, David B. MacQueen
    Selection in Abstract Recursion Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1976, v:41, n:1, pp:153-158 [Journal]
  16. Leo Harrington, Robert I. Soare
    Codable Sets and Orbits of Computably Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:1, pp:1-28 [Journal]

  17. The Complexity of Orbits of Computably Enumerable Sets. [Citation Graph (, )][DBLP]


Search in 0.040secs, Finished in 0.041secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002