default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Irving Soare
Person information
- affiliation: The University of Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j38]S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare:
Corrigendum to "The d.r.e. degrees are not dense" [Ann. Pure Appl. Logic 55 (1991) 125-151]. Ann. Pure Appl. Log. 168(12): 2164-2165 (2017)- 2016
- [b2]Robert I. Soare:
Turing Computability - Theory and Applications. Theory and Applications of Computability, Springer 2016, ISBN 978-3-642-31932-7, pp. 3-249 - 2014
- [p3]Robert Irving Soare:
Turing and the discovery of computability. Turing's Legacy 2014: 467-492 - 2010
- [j37]David Diamondstone, Damir D. Dzhafarov, Robert I. Soare:
Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination. Notre Dame J. Formal Log. 51(1): 127-159 (2010)
2000 – 2009
- 2009
- [j36]Robert I. Soare:
Turing oracle machines, online computing, and three displacements in computability theory. Ann. Pure Appl. Log. 160(3): 368-399 (2009) - 2007
- [j35]Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare:
Bounding homogeneous models. J. Symb. Log. 72(1): 305-323 (2007) - [j34]Karen M. Lange, Robert I. Soare:
Computability of Homogeneous Models. Notre Dame J. Formal Log. 48(1): 143-170 (2007) - [c3]Robert I. Soare:
Computability and Incomputability. CiE 2007: 705-715 - 2006
- [j33]Barbara F. Csima, Robert I. Soare:
Computability results used in differential geometry. J. Symb. Log. 71(4): 1394-1410 (2006) - 2004
- [j32]Robert I. Soare:
Computability theory and differential geometry. Bull. Symb. Log. 10(4): 457-486 (2004) - [j31]Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare:
Bounding prime models. J. Symb. Log. 69(4): 1117-1142 (2004)
1990 – 1999
- 1999
- [p2]Robert I. Soare:
The History and Concept of Computability. Handbook of Computability Theory 1999: 3-36 - [p1]Robert I. Soare:
An Overview of the Computably Enumerable Sets. Handbook of Computability Theory 1999: 199-248 - 1998
- [j30]Leo Harrington, Robert I. Soare:
Definable Properties of the Computably Enumerable Sets. Ann. Pure Appl. Log. 94(1-3): 97-125 (1998) - [j29]Leo Harrington, Robert I. Soare:
Codable Sets and Orbits of Computably Enumerable Sets. J. Symb. Log. 63(1): 1-28 (1998) - [j28]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
- [j27]Leo Harrington, Robert I. Soare:
Definability, automorphisms, and dynamic properties of computably enumerable sets. Bull. Symb. Log. 2(2): 199-213 (1996) - [j26]Robert I. Soare:
Computability and recursion. Bull. Symb. Log. 2(3): 284-321 (1996) - 1994
- [j25]Alistair H. Lachlan, Robert I. Soare:
Models of Arithmetic and Upper Bounds for Arithmetic Sets. J. Symb. Log. 59(3): 977-983 (1994) - [j24]Carl G. Jockusch Jr., Robert I. Soare:
Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. J. Symb. Log. 59(4): 1121-1138 (1994) - [j23]Klaus Ambos-Spies, Steven Homer, Robert I. Soare:
Minimal Pairs and Complete Problems. Theor. Comput. Sci. 132(2): 229-241 (1994) - 1993
- [j22]Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare:
The Continuity of Cupping to 0'. Ann. Pure Appl. Log. 64(3): 195-209 (1993) - 1991
- [j21]Carl G. Jockusch Jr., Robert I. Soare:
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. Ann. Pure Appl. Log. 52(1-2): 39-64 (1991) - [j20]S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare:
The d.r.e. Degrees are Not Dense. Ann. Pure Appl. Log. 55(2): 125-151 (1991) - 1990
- [c2]Klaus Ambos-Spies, Steven Homer, Robert I. Soare:
Minimal Pairs and Complete Problems. STACS 1990: 24-36
1980 – 1989
- 1989
- [j19]Klaus Ambos-Spies, Robert I. Soare:
The Recursively Enumerable Degrees have Infinitely Many One-Types. Ann. Pure Appl. Log. 44(1-2): 1-23 (1989) - [j18]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) - 1987
- [b1]Robert I. Soare:
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets. Perspectives in mathematical logic, Springer 1987, ISBN 978-3-540-15299-6, pp. I-XVIII, 1-437 - 1986
- [j17]Douglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer:
Members of countable π10 classes. Ann. Pure Appl. Log. 31: 145-163 (1986) - 1984
- [j16]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
- [j15]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
- [j14]Robert I. Soare:
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets. Ann. Math. Log. 22(1): 69-107 (1982) - [j13]Robert I. Soare:
Computational Complexity of Recursively Enumerable Sets. Inf. Control. 52(1): 8-18 (1982)
1970 – 1979
- 1978
- [j12]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) - [j11]Victor L. Bennison, Robert I. Soare:
Some Lowness Properties and Computational Complexity Sequences. Theor. Comput. Sci. 6: 233-254 (1978) - 1977
- [j10]Robert I. Soare:
Computational Complexity, Speedable and Levelable Sets. J. Symb. Log. 42(4): 545-563 (1977) - [c1]Victor L. Bennison, Robert I. Soare:
Recursion Theoretic Characterizations of Complexity Theoretic Properties. FOCS 1977: 100-106 - 1976
- [j9]Robert I. Soare:
The Infinite Injury Priority Method. J. Symb. Log. 41(2): 513-530 (1976) - [j8]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
- [j7]Carl G. Jockusch Jr., Robert I. Soare:
Encodability of Kleene's O. J. Symb. Log. 38(3): 437-440 (1973) - [j6]Carl G. Jockusch Jr., Robert I. Soare:
Post's Problem and His Hypersimple Set. J. Symb. Log. 38(3): 446-452 (1973) - 1971
- [j5]Carl G. Jockusch Jr., Robert I. Soare:
A Minimal Pair of pi01 Classes. J. Symb. Log. 36(1): 66-78 (1971) - 1970
- [j4]Robin O. Gandy, Robert I. Soare:
A Problem in the Theory of Constructive Order Types. J. Symb. Log. 35(1): 119-121 (1970)
1960 – 1969
- 1969
- [j3]Robert I. Soare:
Sets with no Subset of Higher Degrees. J. Symb. Log. 34(1): 53-56 (1969) - [j2]Robert I. Soare:
A Note on Degrees of Subsets. J. Symb. Log. 34(2): 256 (1969) - [j1]Robert I. Soare:
Constructive Order Types on Cuts. J. Symb. Log. 34(2): 285-289 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
