Sets with no Subset of Higher Degrees. - Robert I. Soare (J. Symb. Log., 1969)

A Note on Degrees of Subsets. - Robert I. Soare (J. Symb. Log., 1969)

Constructive Order Types on Cuts. - Robert I. Soare (J. Symb. Log., 1969)

A Problem in the Theory of Constructive Order Types. - Robin O. Gandy; Robert I. Soare (J. Symb. Log., 1970)

A Minimal Pair of pi01 Classes. - Carl G. Jockusch Jr.; Robert I. Soare (J. Symb. Log., 1971)

Encodability of Kleene's O. - Carl G. Jockusch Jr.; Robert I. Soare (J. Symb. Log., 1973)

Post's Problem and His Hypersimple Set. - Carl G. Jockusch Jr.; Robert I. Soare (J. Symb. Log., 1973)

Meeting of the Association for Symbolic Logic. - John T. Baldwin 001; Donald A. Martin; Robert I. Soare; William W. Tait (J. Symb. Log., 1976)

The Infinite Injury Priority Method. - Robert I. Soare (J. Symb. Log., 1976)

Recursion Theoretic Characterizations of Complexity Theoretic Properties - Victor L. Bennison; Robert I. Soare (FOCS, 1977)

Computational Complexity, Speedable and Levelable Sets. - Robert I. Soare (J. Symb. Log., 1977)

Meeting of the Association for Symbolic Logic: Chicago, 1977. - Carl G. Jockusch Jr.; Robert I. Soare; William W. Tait; Gaisi Takeuti (J. Symb. Log., 1978)

Some Lowness Properties and Computational Complexity Sequences. - Victor L. Bennison; Robert I. Soare (Theor. Comput. Sci., 1978)

Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets. - Robert I. Soare (Ann. Math. Log., 1982)

Computational Complexity of Recursively Enumerable Sets - Robert I. Soare (Inf. Control., 1982)

Meeting of the Association for Symbolic Logic: Milwaukee, 1981. - Jon Barwise; Robert I. Soare; Terrence Millar (J. Symb. Log., 1983)

Two Theorems on Degrees of Models of True Arithmetic. - Julia F. Knight; Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1984)

Members of countable π10 classes. - Douglas A. Cenzer; Peter Clote; Rick L. Smith; Robert I. Soare; Stanley S. Wainer (Ann. Pure Appl. Log., 1986)

Recursively enumerable sets and degrees - a study of computable functions and computability generated sets. - Robert I. Soare (Springer, 1987)

The Recursively Enumerable Degrees have Infinitely Many One-Types. - Klaus Ambos-Spies; Robert I. Soare (Ann. Pure Appl. Log., 1989)

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion. - Carl G. Jockusch Jr.; Manuel Lerman; Robert I. Soare; Robert Solovay (J. Symb. Log., 1989)

The d.r.e. Degrees are Not Dense. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 1991)

Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. - Carl G. Jockusch Jr.; Robert I. Soare (Ann. Pure Appl. Log., 1991)

The Continuity of Cupping to 0'. - Klaus Ambos-Spies; Alistair H. Lachlan; Robert I. Soare (Ann. Pure Appl. Log., 1993)

Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. - Carl G. Jockusch Jr.; Robert I. Soare (J. Symb. Log., 1994)

Models of Arithmetic and Upper Bounds for Arithmetic Sets. - Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1994)

Minimal Pairs and Complete Problems. - Klaus Ambos-Spies; Steven Homer; Robert I. Soare (Theor. Comput. Sci., 1994)

Definability, automorphisms, and dynamic properties of computably enumerable sets. - Leo Harrington; Robert I. Soare (Bull. Symb. Log., 1996)

Computability and recursion. - Robert I. Soare (Bull. Symb. Log., 1996)

Definable Properties of the Computably Enumerable Sets. - Leo Harrington; Robert I. Soare (Ann. Pure Appl. Log., 1998)

Codable Sets and Orbits of Computably Enumerable Sets. - Leo Harrington; Robert I. Soare (J. Symb. Log., 1998)

Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. - Alistair H. Lachlan; Robert I. Soare (J. Symb. Log., 1998)

The History and Concept of Computability. - Robert I. Soare (Handbook of Computability Theory, 1999)

An Overview of the Computably Enumerable Sets. - Robert I. Soare (Handbook of Computability Theory, 1999)

Computability theory and differential geometry. - Robert I. Soare (Bull. Symb. Log., 2004)

Bounding prime models. - Barbara F. Csima; Denis R. Hirschfeldt; Julia F. Knight; Robert I. Soare (J. Symb. Log., 2004)

Computability results used in differential geometry. - Barbara F. Csima; Robert I. Soare (J. Symb. Log., 2006)

Computability and Incomputability. - Robert I. Soare (CiE, 2007)

Bounding homogeneous models. - Barbara F. Csima; Valentina S. Harizanov; Denis R. Hirschfeldt; Robert I. Soare (J. Symb. Log., 2007)

Computability of Homogeneous Models. - Karen M. Lange; Robert I. Soare (Notre Dame J. Formal Log., 2007)

Turing oracle machines, online computing, and three displacements in computability theory. - Robert I. Soare (Ann. Pure Appl. Log., 2009)

Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination. - David Diamondstone; Damir D. Dzhafarov; Robert I. Soare (Notre Dame J. Formal Log., 2010)

Turing and the discovery of computability. - Robert Irving Soare (Turing's Legacy, 2014)

Turing Computability - Theory and Applications - Robert I. Soare (Springer, 2016)

Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. - S. Barry Cooper; Leo Harrington; Alistair H. Lachlan; Steffen Lempp; Robert I. Soare (Ann. Pure Appl. Log., 2017)