The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

S. Barry Cooper: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. Barry Cooper
    Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:1-7 [Conf]
  2. S. Barry Cooper
    How Can Nature Help Us Compute? [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:1-13 [Conf]
  3. Bahareh Afshari, George Barmpalias, S. Barry Cooper
    Immunity Properties and the n-C.E. Hierarchy. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:694-703 [Conf]
  4. Marat M. Arslanov, Chi Tat Chong, S. Barry Cooper, Yue Yang
    The minimal e-degree problem in fragments of Peano arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:131, n:1-3, pp:159-175 [Journal]
  5. 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]
  6. S. Barry Cooper, Andrea Sorbi, Xiaoding Yi
    Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:82, n:3, pp:317-342 [Journal]
  7. S. Barry Cooper
    Jump Equivalence of the triangle 02 Hyperhyperimmune Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:3, pp:598-600 [Journal]
  8. S. Barry Cooper
    Minimal Degrees and the Jump Operator. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1973, v:38, n:2, pp:249-271 [Journal]
  9. S. Barry Cooper
    Minimal Pairs and High Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:4, pp:655-660 [Journal]
  10. S. Barry Cooper
    Partial Degrees and the Density Problem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1982, v:47, n:4, pp:854-859 [Journal]
  11. S. Barry Cooper
    Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma2 Sets are Dense. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:2, pp:503-513 [Journal]
  12. S. Barry Cooper
    A Jump Class of Noncappable Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:324-353 [Journal]
  13. S. Barry Cooper
    The Strong Anticupping Property for Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:527-539 [Journal]
  14. S. Barry Cooper, Angsheng Li
    Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:4, pp:1391-1430 [Journal]
  15. S. Barry Cooper, Andrea Sorbi
    Noncappable Enumeration Degrees Below 0'e. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:4, pp:1347-1363 [Journal]
  16. Kevin McEvoy, S. Barry Cooper
    On Minimal Pairs of Enumeration Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:4, pp:983-1001 [Journal]
  17. Marat M. Arslanov, S. Barry Cooper, Angsheng Li
    There is No Low Maximal D.C.E. Degree. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:3, pp:409-416 [Journal]
  18. S. Barry Cooper
    On a Conjecture of Kleene and Post. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:1, pp:3-33 [Journal]
  19. S. Barry Cooper
    Strong Minimal Covers for Recursively Enumerableg. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:191-196 [Journal]
  20. Marat M. Arslanov, S. Barry Cooper, Angsheng Li
    There is no low maximal d. c. e. degree - Corrigendum. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2004, v:50, n:6, pp:628-636 [Journal]
  21. S. Barry Cooper, Andrew E. M. Lewis, Yue Yang
    Properly Sigma2 minimal degrees and 0'' complementation. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:3, pp:274-276 [Journal]
  22. S. Barry Cooper
    Definability as hypercomputational effect. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:178, n:1, pp:72-82 [Journal]
  23. Mariya Ivanova Soskova, S. Barry Cooper
    The Strongest Nonsplitting Theorem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:199-211 [Conf]
  24. S. Barry Cooper, Benedikt Löwe, Peter van Emde Boas
    Theory of Computation at CiE 2005. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:1, pp:1-2 [Journal]
  25. S. Barry Cooper, Angsheng Li
    Preface: Theory and applications of models of computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:1, pp:1- [Journal]

  26. The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees. [Citation Graph (, )][DBLP]


  27. Total Degrees and Nonsplitting Properties of Enumeration Degrees. [Citation Graph (, )][DBLP]


  28. The Extended Turing Model as Contextual Tool. [Citation Graph (, )][DBLP]


  29. On the distribution of Lachlan nonsplitting bases. [Citation Graph (, )][DBLP]


  30. On Lachlan's major sub-degree problem. [Citation Graph (, )][DBLP]


  31. Preface. [Citation Graph (, )][DBLP]


  32. Preface. [Citation Graph (, )][DBLP]


  33. Extending and interpreting Post's programme. [Citation Graph (, )][DBLP]


  34. Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature [Citation Graph (, )][DBLP]


  35. Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics [Citation Graph (, )][DBLP]


Search in 0.529secs, Finished in 0.531secs
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