Search the dblp DataBase
Robert I. Soare :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Victor L. Bennison , Robert I. Soare Recursion Theoretic Characterizations of Complexity Theoretic Properties [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:100-106 [Conf ] Klaus Ambos-Spies , Steven Homer , Robert I. Soare Minimal Pairs and Complete Problems. [Citation Graph (0, 0)][DBLP ] STACS, 1990, pp:24-36 [Conf ] Klaus Ambos-Spies , Alistair H. Lachlan , Robert I. Soare The Continuity of Cupping to 0'. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1993, v:64, n:3, pp:195-209 [Journal ] Klaus Ambos-Spies , Robert I. Soare The Recursively Enumerable Degrees have Infinitely Many One-Types. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1989, v:44, n:1-2, pp:1-23 [Journal ] 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 ] 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 ] Carl G. Jockusch Jr. , Robert I. Soare Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1991, v:52, n:1-2, pp:39-64 [Journal ] 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 ] Robert I. Soare Computability theory and differential geometry. [Citation Graph (0, 0)][DBLP ] Bulletin of Symbolic Logic, 2004, v:10, n:4, pp:457-486 [Journal ] Robert I. Soare Computability and recursion. [Citation Graph (0, 0)][DBLP ] Bulletin of Symbolic Logic, 1996, v:2, n:3, pp:284-321 [Journal ] Robert I. Soare Computational Complexity of Recursively Enumerable Sets [Citation Graph (0, 0)][DBLP ] Information and Control, 1982, v:52, n:1, pp:8-18 [Journal ] John T. Baldwin , Donald A. Martin , Robert I. Soare , William W. Tait Meeting of the Association for Symbolic Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:2, pp:551-560 [Journal ] Jon Barwise , Robert I. Soare , Terrence Millar Meeting of the Association for Symbolic Logic: Milwaukee, 1981. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1983, v:48, n:2, pp:514-518 [Journal ] Robin O. Gandy , Robert I. Soare A Problem in the Theory of Constructive Order Types. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1970, v:35, n:1, pp:119-121 [Journal ] 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 ] Carl G. Jockusch Jr. , Manuel Lerman , Robert I. Soare , Robert Solovay Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1989, v:54, n:4, pp:1288-1323 [Journal ] Carl G. Jockusch Jr. , Robert I. Soare A Minimal Pair of pi0 1 Classes. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1971, v:36, n:1, pp:66-78 [Journal ] Carl G. Jockusch Jr. , Robert I. Soare Encodability of Kleene's O. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1973, v:38, n:3, pp:437-440 [Journal ] Carl G. Jockusch Jr. , Robert I. Soare Post's Problem and His Hypersimple Set. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1973, v:38, n:3, pp:446-452 [Journal ] Carl G. Jockusch Jr. , Robert I. Soare Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1994, v:59, n:4, pp:1121-1138 [Journal ] Carl G. Jockusch Jr. , Robert I. Soare , William W. Tait , Gaisi Takeuti Meeting of the Association for Symbolic Logic: Chicago, 1977. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1978, v:43, n:3, pp:614-619 [Journal ] Julia F. Knight , Alistair H. Lachlan , Robert I. Soare Two Theorems on Degrees of Models of True Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1984, v:49, n:2, pp:425-436 [Journal ] Alistair H. Lachlan , Robert I. Soare Models of Arithmetic and Upper Bounds for Arithmetic Sets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1994, v:59, n:3, pp:977-983 [Journal ] Alistair H. Lachlan , Robert I. Soare Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1998, v:63, n:1, pp:59-72 [Journal ] Robert I. Soare Sets with no Subset of Higher Degrees. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1969, v:34, n:1, pp:53-56 [Journal ] Robert I. Soare A Note on Degrees of Subsets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1969, v:34, n:2, pp:256- [Journal ] Robert I. Soare Constructive Order Types on Cuts. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1969, v:34, n:2, pp:285-289 [Journal ] Robert I. Soare The Infinite Injury Priority Method. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:2, pp:513-530 [Journal ] Robert I. Soare Computational Complexity, Speedable and Levelable Sets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:4, pp:545-563 [Journal ] Klaus Ambos-Spies , Steven Homer , Robert I. Soare Minimal Pairs and Complete Problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1994, v:132, n:2, pp:229-241 [Journal ] Victor L. Bennison , Robert I. Soare Some Lowness Properties and Computational Complexity Sequences. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1978, v:6, n:, pp:233-254 [Journal ] Robert I. Soare Computability and Incomputability. [Citation Graph (0, 0)][DBLP ] CiE, 2007, pp:705-715 [Conf ] Turing oracle machines, online computing, and three displacements in computability theory. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.303secs