Robert I. Soare

45 papers A* 1A 1C 1Journal 38

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. Ann. Pure Appl. Log. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
2016	—	`book`	Turing Computability - Theory and Applications Robert I. Soare
2010	J	`jnl`	Π Notre Dame J. Formal Log. David Diamondstone, Damir D. Dzhafarov, Robert I. Soare
2009	J	`jnl`	Turing oracle machines, online computing, and three displacements in computability theory. Ann. Pure Appl. Log. Robert I. Soare
2007	J	`jnl`	Bounding homogeneous models. J. Symb. Log. Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare
2007	C	`conf`	Computability and Incomputability. CiE Robert I. Soare
2007	J	`jnl`	Computability of Homogeneous Models. Notre Dame J. Formal Log. Karen M. Lange, Robert I. Soare
2006	J	`jnl`	Computability results used in differential geometry. J. Symb. Log. Barbara F. Csima, Robert I. Soare
2004	J	`jnl`	Bounding prime models. J. Symb. Log. Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare
2004	J	`jnl`	Computability theory and differential geometry. Bull. Symb. Log. Robert I. Soare
1999	—	`ch.`	An Overview of the Computably Enumerable Sets. Handbook of Computability Theory Robert I. Soare
1999	—	`ch.`	The History and Concept of Computability. Handbook of Computability Theory Robert I. Soare
1998	J	`jnl`	Codable Sets and Orbits of Computably Enumerable Sets. J. Symb. Log. Leo Harrington, Robert I. Soare
1998	J	`jnl`	Definable Properties of the Computably Enumerable Sets. Ann. Pure Appl. Log. Leo Harrington, Robert I. Soare
1998	J	`jnl`	Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. J. Symb. Log. Alistair H. Lachlan, Robert I. Soare
1996	J	`jnl`	Computability and recursion. Bull. Symb. Log. Robert I. Soare
1996	J	`jnl`	Definability, automorphisms, and dynamic properties of computably enumerable sets. Bull. Symb. Log. Leo Harrington, Robert I. Soare
1994	J	`jnl`	Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. J. Symb. Log. Carl G. Jockusch Jr., Robert I. Soare
1994	J	`jnl`	Minimal Pairs and Complete Problems. Theor. Comput. Sci. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
1994	J	`jnl`	Models of Arithmetic and Upper Bounds for Arithmetic Sets. J. Symb. Log. Alistair H. Lachlan, Robert I. Soare
1993	J	`jnl`	The Continuity of Cupping to 0'. Ann. Pure Appl. Log. Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare
1991	J	`jnl`	Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. Ann. Pure Appl. Log. Carl G. Jockusch Jr., Robert I. Soare
1991	J	`jnl`	The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Log. S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare
1990	A	`conf`	Minimal Pairs and Complete Problems. STACS Klaus Ambos-Spies, Steven Homer, Robert I. Soare
1989	J	`jnl`	Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. J. Symb. Log. Carl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay
1989	J	`jnl`	The Recursively Enumerable Degrees have Infinitely Many One-Types. Ann. Pure Appl. Log. Klaus Ambos-Spies, Robert I. Soare
1987	—	`book`	Recursively enumerable sets and degrees - a study of computable functions and computability generated sets. Robert I. Soare
1986	J	`jnl`	Members of countable π Ann. Pure Appl. Log. Douglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer
1984	J	`jnl`	Two Theorems on Degrees of Models of True Arithmetic. J. Symb. Log. Julia F. Knight, Alistair H. Lachlan, Robert I. Soare
1983	J	`jnl`	Meeting of the Association for Symbolic Logic: Milwaukee, 1981. J. Symb. Log. Jon Barwise, Robert I. Soare, Terrence Millar
1982	J	`jnl`	Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets. Ann. Math. Log. Robert I. Soare
1982	J	`jnl`	Computational Complexity of Recursively Enumerable Sets Inf. Control. Robert I. Soare
1978	J	`jnl`	Meeting of the Association for Symbolic Logic: Chicago, 1977. J. Symb. Log. Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti
1978	J	`jnl`	Some Lowness Properties and Computational Complexity Sequences. Theor. Comput. Sci. Victor L. Bennison, Robert I. Soare
1977	J	`jnl`	Computational Complexity, Speedable and Levelable Sets. J. Symb. Log. Robert I. Soare
1977	A*	`conf`	Recursion Theoretic Characterizations of Complexity Theoretic Properties FOCS Victor L. Bennison, Robert I. Soare
1976	J	`jnl`	Meeting of the Association for Symbolic Logic. J. Symb. Log. John T. Baldwin, Donald A. Martin, Robert I. Soare, William W. Tait
1976	J	`jnl`	The Infinite Injury Priority Method. J. Symb. Log. Robert I. Soare
1973	J	`jnl`	Encodability of Kleene's O. J. Symb. Log. Carl G. Jockusch Jr., Robert I. Soare
1973	J	`jnl`	Post's Problem and His Hypersimple Set. J. Symb. Log. Carl G. Jockusch Jr., Robert I. Soare
1971	J	`jnl`	A Minimal Pair of pi J. Symb. Log. Carl G. Jockusch Jr., Robert I. Soare
1970	J	`jnl`	A Problem in the Theory of Constructive Order Types. J. Symb. Log. Robin O. Gandy, Robert I. Soare
1969	J	`jnl`	A Note on Degrees of Subsets. J. Symb. Log. Robert I. Soare
1969	J	`jnl`	Constructive Order Types on Cuts. J. Symb. Log. Robert I. Soare
1969	J	`jnl`	Sets with no Subset of Higher Degrees. J. Symb. Log. Robert I. Soare