| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | David Diamondstone, Damir D. Dzhafarov, Robert I. Soare |
Pi01 Classes, Peano Arithmetic, Randomness, and Computable Domination.  |
Notre Dame Journal of Formal Logic  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Turing oracle machines, online computing, and three displacements in computability theory. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Karen Lange, Robert I. Soare |
Computability of Homogeneous Models. |
Notre Dame Journal of Formal Logic |
2007 |
DBLP BibTeX RDF |
|
| 1 | Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare |
Bounding homogeneous models. |
J. Symb. Log. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Computability and Incomputability. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Turing a-machine, Church-Turing Thesis, Kurt Gödel, Turing o-machine, computable approximations, effectively continuous functions on reals, computability in analysis, strong reducibilities reexamined, computability, Alan Turing |
| 1 | Barbara F. Csima, Robert I. Soare |
Computability results used in differential geometry. |
J. Symb. Log. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare |
Bounding prime models. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Computability theory and differential geometry. |
Bulletin of Symbolic Logic |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alistair H. Lachlan, Robert I. Soare |
Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets. |
J. Symb. Log. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Leo Harrington, Robert I. Soare |
Codable Sets and Orbits of Computably Enumerable Sets. |
J. Symb. Log. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Leo Harrington, Robert I. Soare |
Definable Properties of the Computably Enumerable Sets. |
Ann. Pure Appl. Logic |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Harrington, Robert I. Soare |
Definability, automorphisms, and dynamic properties of computably enumerable sets. |
Bulletin of Symbolic Logic |
1996 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Computability and recursion. |
Bulletin of Symbolic Logic |
1996 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
Minimal Pairs and Complete Problems. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Robert I. Soare |
Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. |
J. Symb. Log. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Alistair H. Lachlan, Robert I. Soare |
Models of Arithmetic and Upper Bounds for Arithmetic Sets. |
J. Symb. Log. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare |
The Continuity of Cupping to 0'. |
Ann. Pure Appl. Logic |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Robert I. Soare |
Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. |
Ann. Pure Appl. Logic |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare |
The d.r.e. Degrees are Not Dense. |
Ann. Pure Appl. Logic |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
Minimal Pairs and Complete Problems. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Robert I. Soare |
The Recursively Enumerable Degrees have Infinitely Many One-Types. |
Ann. Pure Appl. Logic |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia F. Knight, Alistair H. Lachlan, Robert I. Soare |
Two Theorems on Degrees of Models of True Arithmetic. |
J. Symb. Log. |
1984 |
DBLP BibTeX RDF |
|
| 1 | Jon Barwise, Robert I. Soare, Terrence Millar |
Meeting of the Association for Symbolic Logic: Milwaukee, 1981. |
J. Symb. Log. |
1983 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Computational Complexity of Recursively Enumerable Sets |
Information and Control |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor L. Bennison, Robert I. Soare |
Some Lowness Properties and Computational Complexity Sequences. |
Theor. Comput. Sci. |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti |
Meeting of the Association for Symbolic Logic: Chicago, 1977. |
J. Symb. Log. |
1978 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Computational Complexity, Speedable and Levelable Sets. |
J. Symb. Log. |
1977 |
DBLP BibTeX RDF |
|
| 1 | Victor L. Bennison, Robert I. Soare |
Recursion Theoretic Characterizations of Complexity Theoretic Properties |
FOCS |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert I. Soare |
The Infinite Injury Priority Method. |
J. Symb. Log. |
1976 |
DBLP BibTeX RDF |
|
| 1 | John T. Baldwin, Donald A. Martin, Robert I. Soare, William W. Tait |
Meeting of the Association for Symbolic Logic. |
J. Symb. Log. |
1976 |
DBLP BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Robert I. Soare |
Encodability of Kleene's O. |
J. Symb. Log. |
1973 |
DBLP BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Robert I. Soare |
Post's Problem and His Hypersimple Set. |
J. Symb. Log. |
1973 |
DBLP BibTeX RDF |
|
| 1 | Carl G. Jockusch Jr., Robert I. Soare |
A Minimal Pair of pi01 Classes. |
J. Symb. Log. |
1971 |
DBLP BibTeX RDF |
|
| 1 | Robin O. Gandy, Robert I. Soare |
A Problem in the Theory of Constructive Order Types. |
J. Symb. Log. |
1970 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Constructive Order Types on Cuts. |
J. Symb. Log. |
1969 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
Sets with no Subset of Higher Degrees. |
J. Symb. Log. |
1969 |
DBLP BibTeX RDF |
|
| 1 | Robert I. Soare |
A Note on Degrees of Subsets. |
J. Symb. Log. |
1969 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")