| 2007 |
|---|
| 32 | EE | Robert I. Soare:
Computability and Incomputability.
CiE 2007: 705-715 |
| 2004 |
|---|
| 31 | EE | Robert I. Soare:
Computability theory and differential geometry.
Bulletin of Symbolic Logic 10(4): 457-486 (2004) |
| 1998 |
|---|
| 30 | | Leo Harrington,
Robert I. Soare:
Definable Properties of the Computably Enumerable Sets.
Ann. Pure Appl. Logic 94(1-3): 97-125 (1998) |
| 29 | | Leo Harrington,
Robert I. Soare:
Codable Sets and Orbits of Computably Enumerable Sets.
J. Symb. Log. 63(1): 1-28 (1998) |
| 28 | | Alistair H. Lachlan,
Robert I. Soare:
Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets.
J. Symb. Log. 63(1): 59-72 (1998) |
| 1996 |
|---|
| 27 | EE | Leo Harrington,
Robert I. Soare:
Definability, automorphisms, and dynamic properties of computably enumerable sets.
Bulletin of Symbolic Logic 2(2): 199-213 (1996) |
| 26 | EE | Robert I. Soare:
Computability and recursion.
Bulletin of Symbolic Logic 2(3): 284-321 (1996) |
| 1994 |
|---|
| 25 | | Alistair H. Lachlan,
Robert I. Soare:
Models of Arithmetic and Upper Bounds for Arithmetic Sets.
J. Symb. Log. 59(3): 977-983 (1994) |
| 24 | | Carl G. Jockusch Jr.,
Robert I. Soare:
Boolean Algebras, Stone Spaces, and the Iterated Turing Jump.
J. Symb. Log. 59(4): 1121-1138 (1994) |
| 23 | | Klaus Ambos-Spies,
Steven Homer,
Robert I. Soare:
Minimal Pairs and Complete Problems.
Theor. Comput. Sci. 132(2): 229-241 (1994) |
| 1993 |
|---|
| 22 | | Klaus Ambos-Spies,
Alistair H. Lachlan,
Robert I. Soare:
The Continuity of Cupping to 0'.
Ann. Pure Appl. Logic 64(3): 195-209 (1993) |
| 1991 |
|---|
| 21 | | Carl G. Jockusch Jr.,
Robert I. Soare:
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings.
Ann. Pure Appl. Logic 52(1-2): 39-64 (1991) |
| 20 | | 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) |
| 1990 |
|---|
| 19 | | Klaus Ambos-Spies,
Steven Homer,
Robert I. Soare:
Minimal Pairs and Complete Problems.
STACS 1990: 24-36 |
| 1989 |
|---|
| 18 | | Klaus Ambos-Spies,
Robert I. Soare:
The Recursively Enumerable Degrees have Infinitely Many One-Types.
Ann. Pure Appl. Logic 44(1-2): 1-23 (1989) |
| 17 | | Carl G. Jockusch Jr.,
Manuel Lerman,
Robert I. Soare,
Robert Solovay:
Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.
J. Symb. Log. 54(4): 1288-1323 (1989) |
| 1984 |
|---|
| 16 | | Julia F. Knight,
Alistair H. Lachlan,
Robert I. Soare:
Two Theorems on Degrees of Models of True Arithmetic.
J. Symb. Log. 49(2): 425-436 (1984) |
| 1983 |
|---|
| 15 | | Jon Barwise,
Robert I. Soare,
Terrence Millar:
Meeting of the Association for Symbolic Logic: Milwaukee, 1981.
J. Symb. Log. 48(2): 514-518 (1983) |
| 1982 |
|---|
| 14 | | Robert I. Soare:
Computational Complexity of Recursively Enumerable Sets
Information and Control 52(1): 8-18 (1982) |
| 1978 |
|---|
| 13 | | Carl G. Jockusch Jr.,
Robert I. Soare,
William W. Tait,
Gaisi Takeuti:
Meeting of the Association for Symbolic Logic: Chicago, 1977.
J. Symb. Log. 43(3): 614-619 (1978) |
| 12 | | Victor L. Bennison,
Robert I. Soare:
Some Lowness Properties and Computational Complexity Sequences.
Theor. Comput. Sci. 6: 233-254 (1978) |
| 1977 |
|---|
| 11 | | Victor L. Bennison,
Robert I. Soare:
Recursion Theoretic Characterizations of Complexity Theoretic Properties
FOCS 1977: 100-106 |
| 10 | | Robert I. Soare:
Computational Complexity, Speedable and Levelable Sets.
J. Symb. Log. 42(4): 545-563 (1977) |
| 1976 |
|---|
| 9 | | Robert I. Soare:
The Infinite Injury Priority Method.
J. Symb. Log. 41(2): 513-530 (1976) |
| 8 | | John T. Baldwin,
Donald A. Martin,
Robert I. Soare,
William W. Tait:
Meeting of the Association for Symbolic Logic.
J. Symb. Log. 41(2): 551-560 (1976) |
| 1973 |
|---|
| 7 | | Carl G. Jockusch Jr.,
Robert I. Soare:
Encodability of Kleene's O.
J. Symb. Log. 38(3): 437-440 (1973) |
| 6 | | Carl G. Jockusch Jr.,
Robert I. Soare:
Post's Problem and His Hypersimple Set.
J. Symb. Log. 38(3): 446-452 (1973) |
| 1971 |
|---|
| 5 | | Carl G. Jockusch Jr.,
Robert I. Soare:
A Minimal Pair of pi01 Classes.
J. Symb. Log. 36(1): 66-78 (1971) |
| 1970 |
|---|
| 4 | | Robin O. Gandy,
Robert I. Soare:
A Problem in the Theory of Constructive Order Types.
J. Symb. Log. 35(1): 119-121 (1970) |
| 1969 |
|---|
| 3 | | Robert I. Soare:
Sets with no Subset of Higher Degrees.
J. Symb. Log. 34(1): 53-56 (1969) |
| 2 | | Robert I. Soare:
A Note on Degrees of Subsets.
J. Symb. Log. 34(2): 256 (1969) |
| 1 | | Robert I. Soare:
Constructive Order Types on Cuts.
J. Symb. Log. 34(2): 285-289 (1969) |
