Robert I. Soare | Academic Influence

Robert I. Soare's AcademicInfluence.com Rankings

Robert I. Soare

Mathematics

#3098

World Rank

#4640

Historical Rank

#1173

USA Rank

Measure Theory

#1950

World Rank

#2372

Historical Rank

#586

USA Rank

mathematics Degrees

Download Badge

Mathematics

Robert I. Soare's Degrees

PhD Mathematics University of Chicago
Bachelors Mathematics University of Chicago

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Robert I. Soare Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Robert Irving Soare is an American mathematician. He is the Paul Snowden Russell Distinguished Service Professor of Mathematics and Computer Science at the University of Chicago, where he has been on the faculty since 1967. He proved, together with Carl Jockusch, the low basis theorem, and has done other work in mathematical logic, primarily in the area of computability theory.

(See a Problem?)

Robert I. Soare's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Recursively enumerable sets and degrees (1987) (1951)
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets (1987) (368)
Π⁰₁ classes and degrees of theories (1972) (351)
Computability and Recursion (1996) (233)
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees (1984) (118)
Degrees of members of Π10 classes (1972) (107)
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets (1974) (94)
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets (1982) (89)
The d.r.e. Degrees are Not Dense (1991) (85)
Recursive theory and Dedekind cuts (1969) (80)
Turing oracle machines, online computing, and three displacements in computability theory (2009) (73)
Computational complexity, speedable and levelable sets (1977) (65)
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings (1991) (64)
Post's program and incomplete recursively enumerable sets. (1991) (61)
Turing Computability: Theory and Applications (2016) (59)
The infinite injury priority method (1976) (58)
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion (1989) (58)
Turing Computability (2016) (56)
Computability Theory and Differential Geometry (2004) (50)
Cohesive sets and recursively enumerable Dedekind cuts (1969) (47)
Not every finite lattice is embeddable in the recursively enumerable degrees (1980) (42)
The History and Concept of Computability (1999) (37)
Members of countable π10 classes (1986) (36)
Minimal covers and arithmetical sets (1970) (34)
Bounding prime models (2004) (32)
Boolean algebras, Stone spaces, and the iterated Turing jump (1994) (32)
Games in Recursion Theory and Continuity Properties of Capping Degrees (1992) (30)
Fundamentals of Recursively Enumerable Sets and the Recursion Theorem (1987) (29)
Extension of embeddings in the computably enumerable degrees (2001) (28)
The Δ₃⁰-automorphism method and noninvariant classes of degrees (1996) (28)
The plus-cupping theorem for the recursively enumerable degrees (1981) (28)
The Friedberg-Muchnik Theorem Re-Examined (1972) (28)
The elementary theory of the recursively enumerable degrees is not N0-categorical (1984) (27)
Sets with no subset of higher degree (1969) (26)
Relative Recursive Enumerability (1982) (26)
d-simple sets, small sets, and degree classes (1980) (25)
Logic Year 1979–80 (1981) (24)
The 0 3 -automorphism Method and Noninvariant Classes of Degrees (1996) (24)
The Recursively Enumerable Degrees have Infinitely Many One-Types (1989) (23)
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets (1996) (22)
A decidable fragment of the elementary theory of the lattice of recursively enumerable sets (1980) (20)
The Continuity of Cupping to 0' (1993) (20)
Codable sets and orbits of computably enumerable sets (1998) (19)
Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination (2010) (19)
Algebraic aspects of the computably enumerable degrees. (1995) (17)
Some Lowness Properties and Computational Complexity Sequences (1978) (17)
r-Maximal major subsets (1978) (16)
Recursion Theory: its Generalisations and Applications: Fundamental Methods for Constructing Recursively Enumerable Degrees (1980) (16)
Two theorems on degrees of models of true arithmetic (1984) (16)
Computability Results Used in Differential Geometry (2006) (15)
A minimal pair of Π10 classes (1971) (15)
Computability and Incomputability (2007) (14)
Boolean algebras, splitting theorems, and $Δ^0_2$ sets (1975) (13)
Computational Complexity of Recursively Enumerable Sets (1982) (13)
Definable Properties of the Computably Enumerable Sets (1998) (13)
Dynamic properties of computably enumerable sets (1996) (12)
Models of arithmetic and upper bounds for arithmetic sets (1994) (10)
Applications of computability theory to prime models and differential geometry (2003) (10)
An Overview of the Computably Enumerable Sets (1999) (10)
Post's problem and his hypersimple set (1973) (8)
Computability of Homogeneous Models (2007) (7)
Constructive order types on cuts (1969) (6)
Formalism and intuition in computability (2012) (6)
Minimal Pairs and Complete Problems (1990) (5)
Bounding homogenous models (2007) (5)
Computability and Enumerability (1997) (5)
DEGREES OF MEMBERS OF Π\ CLASSES (2012) (5)
DEGREES OF MEMBERS OF Π\ CLASSES (2012) (5)
Turing and the Art of Classical Computability (2011) (4)
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151] (2017) (4)
Extensions, Automorphisms, and Definability (4)
Encodability of Kleene's O (1973) (4)
Turing and the discovery of computability (2014) (3)
History of Computability (2016) (3)
Why Turing’s Thesis Is Not a Thesis (2015) (3)
Isomorphisms on countable vector spaces with recursive operations (1974) (3)
Meeting of the Association for Symbolic Logic, Chicago, 1977 (1976) (3)
Models of arithmetic and subuniform bounds for the arithmetic sets (1998) (3)
Turing Computability and Information Content (2011) (2)
^-SIMPLE SETS, SMALL SETS, AND DEGREE CLASSES (2004) (2)
Meeting of the Association for Symbolic Logic, Milwaukee, 1981 (1983) (1)
A problem in the theory of constructive order types (1970) (1)
The Continuity of Cupping to 0 0 (1993) (1)
Banach-Mazur Games (2016) (1)
Computably Enumerable Sets (2016) (1)
A Minimal Pair of pi01 Classes (1971) (1)
Automorphisms of the Lattice of R.E. Sets (1987) (1)
Constructions in the Recursively Enumerable Degrees (2010) (1)
Computability, definability, categoricity, and automorphisms (2000) (1)
MINIMAL COVERS AND ARITHMETICAL SETS1 (2010) (0)
On properties related to k-triviality (2011) (0)
An Interview with r obert Soare (2012) (0)
Logic Year 1979-80, the University of Connecticut, Usa (1981) (0)
Promptly Simple Sets, Coincidence of Classes of R.E. Degrees, and an Algebraic Decomposition of the R.E. Degrees (1987) (0)
The Relationship Between the Structure and the Degree of an R.E. Set (1987) (0)
Church-Turing Completeness: Syntax and Semantics (2012) (0)
The Lattice of R.E. Sets Under Inclusion (1987) (0)
More Lachlan Games (2016) (0)
Peano Arithmetic and $$\Pi_1^0$$-Classes (2016) (0)
Recursion theoretic characterizations of complexity theoretic properties (1977) (0)
Oracle Constructions and Forcing (2016) (0)
The complexity of classical theorems on saturated models (2007) (0)
Further Results and Open Questions About R.E. Sets and Degrees (1987) (0)
Minimal Degrees Below \(\emptyset^{\prime\prime}\) (2016) (0)
Contents Incomputability, Turing Functionals, and Open Computing (2008) (0)
The Minimal Pair Method and Embedding Lattices into the R.E. Degrees (1987) (0)
Oracle Constructions of Non-R.E. Degrees (1987) (0)
Minimal Degrees Below \emptyset^{\prime} (2016) (0)
The Finite Injury Method (2016) (0)
n° CLASSES AND DEGREES OF THEORIESi1) (2010) (0)
A note on degrees of subsets1 (1969) (0)
Post's programandincomplete recursively enumerable sets (1991) (0)
Recursive Enumerability (2010) (0)
Turing Reducibility and the Jump Operator (1987) (0)
Review of Peter Cholak, “Automorphisms of the Lattice of Recursively Enumerable Sets ” Memoirs of the American Math. Soc. (1995) viii+151 pp and (2005) (0)
Simple Sets and Post’s Problem (1987) (0)
Classifying C.E. Sets (2016) (0)
Open and Closed Classes (2016) (0)
1994–1995 Winter Meeting of the Association for Symbolic Logic (1995) (0)
Randomness and \(\Pi_1^0\)-Classes (2016) (0)
The Tree Method and O‴-Priority Arguments (1987) (0)
Master Index to Volumes 61-70 (1994) (0)
Classifying Index Sets of R.E. Sets (1987) (0)
The Interplay Between Computability and Incomputability Draft 619.tex (2008) (0)
The Arithmetical Hierarchy (2016) (0)

This paper list is powered by the following services:

Other Resources About Robert I. Soare

en.wikipedia.org

What Schools Are Affiliated With Robert I. Soare?

Robert I. Soare is affiliated with the following schools:

Image Attributions

Image Source for Robert I. Soare