2009 |
40 | EE | Jin-yi Cai,
S. Barry Cooper,
Angsheng Li:
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).
Mathematical Structures in Computer Science 19(1): 5-7 (2009) |
39 | EE | S. Barry Cooper,
Hong Zhu:
Preface: Algorithms, complexity and models of computation.
Theor. Comput. Sci. 410(11): 1001-1002 (2009) |
38 | EE | Paola Bonizzoni,
S. Barry Cooper,
Benedikt Löwe,
Andrea Sorbi:
Foreword.
Theor. Comput. Sci. 410(4-5): 283-284 (2009) |
2008 |
37 | EE | Marat M. Arslanov,
S. Barry Cooper,
Iskander Sh. Kalimullin,
Mariya Ivanova Soskova:
Total Degrees and Nonsplitting Properties of Enumeration Degrees.
TAMC 2008: 568-578 |
36 | EE | S. Barry Cooper,
Matthew C. Salts,
Guohua Wu:
The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees.
TAMC 2008: 588-596 |
35 | EE | S. Barry Cooper:
Computability.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
34 | EE | S. Barry Cooper,
Herman Geuvers,
Anand Pillay,
Jouko A. Väänänen:
Preface.
Ann. Pure Appl. Logic 156(1): 1-2 (2008) |
33 | EE | S. Barry Cooper,
Angsheng Li:
On Lachlan's major sub-degree problem.
Arch. Math. Log. 47(4): 341-434 (2008) |
2007 |
32 | | Jin-yi Cai,
S. Barry Cooper,
Hong Zhu:
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings
Springer 2007 |
31 | | S. Barry Cooper,
Benedikt Löwe,
Andrea Sorbi:
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings
Springer 2007 |
30 | EE | Mariya Ivanova Soskova,
S. Barry Cooper:
The Strongest Nonsplitting Theorem.
TAMC 2007: 199-211 |
29 | EE | Bahareh Afshari,
George Barmpalias,
S. Barry Cooper,
Frank Stephan:
Post's Programme for the Ershov Hierarchy.
J. Log. Comput. 17(6): 1025-1040 (2007) |
28 | EE | S. Barry Cooper,
Angsheng Li:
Preface: Theory and applications of models of computation.
Theor. Comput. Sci. 384(1): 1 (2007) |
27 | EE | S. Barry Cooper,
Benedikt Löwe,
Peter van Emde Boas:
Theory of Computation at CiE 2005.
Theory Comput. Syst. 41(1): 1-2 (2007) |
2006 |
26 | | Jin-yi Cai,
S. Barry Cooper,
Angsheng Li:
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings
Springer 2006 |
25 | EE | S. Barry Cooper:
How Can Nature Help Us Compute?
SOFSEM 2006: 1-13 |
24 | EE | Bahareh Afshari,
George Barmpalias,
S. Barry Cooper:
Immunity Properties and the n-C.E. Hierarchy.
TAMC 2006: 694-703 |
23 | EE | S. Barry Cooper:
Definability as hypercomputational effect.
Applied Mathematics and Computation 178(1): 72-82 (2006) |
22 | EE | S. Barry Cooper,
Benedikt Löwe,
Dag Normann:
Mathematics of computing at CiE 2005.
Mathematical Structures in Computer Science 16(5): 735-736 (2006) |
2005 |
21 | | S. Barry Cooper,
Benedikt Löwe,
Leen Torenvliet:
New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings
Springer 2005 |
20 | EE | S. Barry Cooper:
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It.
CiE 2005: 1-7 |
19 | EE | Marat M. Arslanov,
Chi Tat Chong,
S. Barry Cooper,
Yue Yang:
The minimal e-degree problem in fragments of Peano arithmetic.
Ann. Pure Appl. Logic 131(1-3): 159-175 (2005) |
18 | EE | S. Barry Cooper,
Andrew E. M. Lewis,
Yue Yang:
Properly Sigma2 minimal degrees and 0'' complementation.
Math. Log. Q. 51(3): 274-276 (2005) |
2004 |
17 | EE | Marat M. Arslanov,
S. Barry Cooper,
Angsheng Li:
There is no low maximal d. c. e. degree - Corrigendum.
Math. Log. Q. 50(6): 628-636 (2004) |
2002 |
16 | EE | S. Barry Cooper,
Angsheng Li,
Xiaoding Yi:
On the distribution of Lachlan nonsplitting bases.
Arch. Math. Log. 41(5): 455-482 (2002) |
15 | | S. Barry Cooper,
Angsheng Li:
Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable.
J. Symb. Log. 67(4): 1391-1430 (2002) |
2001 |
14 | EE | S. Barry Cooper:
On a Conjecture of Kleene and Post.
Math. Log. Q. 47(1): 3-33 (2001) |
2000 |
13 | EE | Marat M. Arslanov,
S. Barry Cooper,
Angsheng Li:
There is No Low Maximal D.C.E. Degree.
Math. Log. Q. 46(3): 409-416 (2000) |
1996 |
12 | | S. Barry Cooper,
Andrea Sorbi,
Xiaoding Yi:
Cupping and Noncupping in the Enumeration Degrees of Sigma20 Sets.
Ann. Pure Appl. Logic 82(3): 317-342 (1996) |
11 | | S. Barry Cooper,
Andrea Sorbi:
Noncappable Enumeration Degrees Below 0'e.
J. Symb. Log. 61(4): 1347-1363 (1996) |
10 | | S. Barry Cooper:
Strong Minimal Covers for Recursively Enumerableg.
Math. Log. Q. 42: 191-196 (1996) |
1991 |
9 | | S. Barry Cooper,
Leo Harrington,
Alistair H. Lachlan,
Steffen Lempp,
Robert I. Soare:
The d.r.e. Degrees are Not Dense.
Ann. Pure Appl. Logic 55(2): 125-151 (1991) |
1989 |
8 | | S. Barry Cooper:
A Jump Class of Noncappable Degrees.
J. Symb. Log. 54(2): 324-353 (1989) |
7 | | S. Barry Cooper:
The Strong Anticupping Property for Recursively Enumerable Degrees.
J. Symb. Log. 54(2): 527-539 (1989) |
1985 |
6 | | Kevin McEvoy,
S. Barry Cooper:
On Minimal Pairs of Enumeration Degrees.
J. Symb. Log. 50(4): 983-1001 (1985) |
1984 |
5 | | S. Barry Cooper:
Partial Degrees and the Density Problem. Part 2: The Enumeration Degrees of the sigma2 Sets are Dense.
J. Symb. Log. 49(2): 503-513 (1984) |
1982 |
4 | | S. Barry Cooper:
Partial Degrees and the Density Problem.
J. Symb. Log. 47(4): 854-859 (1982) |
1974 |
3 | | S. Barry Cooper:
Minimal Pairs and High Recursively Enumerable Degrees.
J. Symb. Log. 39(4): 655-660 (1974) |
1973 |
2 | | S. Barry Cooper:
Minimal Degrees and the Jump Operator.
J. Symb. Log. 38(2): 249-271 (1973) |
1972 |
1 | | S. Barry Cooper:
Jump Equivalence of the triangle 02 Hyperhyperimmune Sets.
J. Symb. Log. 37(3): 598-600 (1972) |