DBLP: Robert I. Soare

	2010
j35		David Diamondstone, Damir D. Dzhafarov, Robert I. Soare: Pi⁰₁ Classes, Peano Arithmetic, Randomness, and Computable Domination. Notre Dame Journal of Formal Logic 51(1): 127-159 (2010)
	2009
j34		Robert I. Soare: Turing oracle machines, online computing, and three displacements in computability theory. Ann. Pure Appl. Logic 160(3): 368-399 (2009)
	2007
j33		Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare: Bounding homogeneous models. J. Symb. Log. 72(1): 305-323 (2007)
j32		Karen Lange, Robert I. Soare: Computability of Homogeneous Models. Notre Dame Journal of Formal Logic 48(1): 143-170 (2007)
c3		Robert I. Soare: Computability and Incomputability. CiE 2007: 705-715
	2006
j31		Barbara F. Csima, Robert I. Soare: Computability results used in differential geometry. J. Symb. Log. 71(4): 1394-1410 (2006)
	2004
j30		Robert I. Soare: Computability theory and differential geometry. Bulletin of Symbolic Logic 10(4): 457-486 (2004)
j29		Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare: Bounding prime models. J. Symb. Log. 69(4): 1117-1142 (2004)
	1998
j28		Leo Harrington, Robert I. Soare: Definable Properties of the Computably Enumerable Sets. Ann. Pure Appl. Logic 94(1-3): 97-125 (1998)
j27		Leo Harrington, Robert I. Soare: Codable Sets and Orbits of Computably Enumerable Sets. J. Symb. Log. 63(1): 1-28 (1998)
j26		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
j25		Leo Harrington, Robert I. Soare: Definability, automorphisms, and dynamic properties of computably enumerable sets. Bulletin of Symbolic Logic 2(2): 199-213 (1996)
j24		Robert I. Soare: Computability and recursion. Bulletin of Symbolic Logic 2(3): 284-321 (1996)
	1994
j23		Alistair H. Lachlan, Robert I. Soare: Models of Arithmetic and Upper Bounds for Arithmetic Sets. J. Symb. Log. 59(3): 977-983 (1994)
j22		Carl G. Jockusch Jr., Robert I. Soare: Boolean Algebras, Stone Spaces, and the Iterated Turing Jump. J. Symb. Log. 59(4): 1121-1138 (1994)
j21		Klaus Ambos-Spies, Steven Homer, Robert I. Soare: Minimal Pairs and Complete Problems. Theor. Comput. Sci. 132(2): 229-241 (1994)
	1993
j20		Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare: The Continuity of Cupping to 0'. Ann. Pure Appl. Logic 64(3): 195-209 (1993)
	1991
j19		Carl G. Jockusch Jr., Robert I. Soare: Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. Ann. Pure Appl. Logic 52(1-2): 39-64 (1991)
j18		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 55(2): 125-151 (1991)
	1990
c2		Klaus Ambos-Spies, Steven Homer, Robert I. Soare: Minimal Pairs and Complete Problems. STACS 1990: 24-36
	1989
j17		Klaus Ambos-Spies, Robert I. Soare: The Recursively Enumerable Degrees have Infinitely Many One-Types. Ann. Pure Appl. Logic 44(1-2): 1-23 (1989)
j16		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)
	1984
j15		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
j14		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
j13		Robert I. Soare: Computational Complexity of Recursively Enumerable Sets. Information and Control 52(1): 8-18 (1982)
	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 pi⁰₁ 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)
	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)

2010

j35

David Diamondstone, Damir D. Dzhafarov, Robert I. Soare: Pi⁰₁ Classes, Peano Arithmetic, Randomness, and Computable Domination. Notre Dame Journal of Formal Logic 51(1): 127-159 (2010)

2009

j34

Robert I. Soare: Turing oracle machines, online computing, and three displacements in computability theory. Ann. Pure Appl. Logic 160(3): 368-399 (2009)

2007

j33

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

j32

Karen Lange, Robert I. Soare: Computability of Homogeneous Models. Notre Dame Journal of Formal Logic 48(1): 143-170 (2007)

Robert I. Soare: Computability and Incomputability. CiE 2007: 705-715

2006

j31

Barbara F. Csima, Robert I. Soare: Computability results used in differential geometry. J. Symb. Log. 71(4): 1394-1410 (2006)

2004

j30

Robert I. Soare: Computability theory and differential geometry. Bulletin of Symbolic Logic 10(4): 457-486 (2004)

j29

Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare: Bounding prime models. J. Symb. Log. 69(4): 1117-1142 (2004)

1998

j28

Leo Harrington, Robert I. Soare: Definable Properties of the Computably Enumerable Sets. Ann. Pure Appl. Logic 94(1-3): 97-125 (1998)

j27

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

j26

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

j25

Leo Harrington, Robert I. Soare: Definability, automorphisms, and dynamic properties of computably enumerable sets. Bulletin of Symbolic Logic 2(2): 199-213 (1996)

j24

Robert I. Soare: Computability and recursion. Bulletin of Symbolic Logic 2(3): 284-321 (1996)

1994

j23

Alistair H. Lachlan, Robert I. Soare: Models of Arithmetic and Upper Bounds for Arithmetic Sets. J. Symb. Log. 59(3): 977-983 (1994)

j22

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

j21

Klaus Ambos-Spies, Steven Homer, Robert I. Soare: Minimal Pairs and Complete Problems. Theor. Comput. Sci. 132(2): 229-241 (1994)

1993

j20

Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare: The Continuity of Cupping to 0'. Ann. Pure Appl. Logic 64(3): 195-209 (1993)

1991

j19

Carl G. Jockusch Jr., Robert I. Soare: Degrees of Orderings Not Isomorphic to Recursive Linear Orderings. Ann. Pure Appl. Logic 52(1-2): 39-64 (1991)

j18

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 55(2): 125-151 (1991)

1990

Klaus Ambos-Spies, Steven Homer, Robert I. Soare: Minimal Pairs and Complete Problems. STACS 1990: 24-36

1989

j17

Klaus Ambos-Spies, Robert I. Soare: The Recursively Enumerable Degrees have Infinitely Many One-Types. Ann. Pure Appl. Logic 44(1-2): 1-23 (1989)

j16

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)

1984

j15

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

j14

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

j13

Robert I. Soare: Computational Complexity of Recursively Enumerable Sets. Information and Control 52(1): 8-18 (1982)

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)

Victor L. Bennison, Robert I. Soare: Recursion Theoretic Characterizations of Complexity Theoretic Properties. FOCS 1977: 100-106

1976

Robert I. Soare: The Infinite Injury Priority Method. J. Symb. Log. 41(2): 513-530 (1976)

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

Carl G. Jockusch Jr., Robert I. Soare: Encodability of Kleene's O. J. Symb. Log. 38(3): 437-440 (1973)

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

1971

Carl G. Jockusch Jr., Robert I. Soare: A Minimal Pair of pi⁰₁ Classes. J. Symb. Log. 36(1): 66-78 (1971)

1970

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

1969

Robert I. Soare: Sets with no Subset of Higher Degrees. J. Symb. Log. 34(1): 53-56 (1969)

Robert I. Soare: A Note on Degrees of Subsets. J. Symb. Log. 34(2): 256 (1969)

Robert I. Soare: Constructive Order Types on Cuts. J. Symb. Log. 34(2): 285-289 (1969)

1	Klaus Ambos-Spies	[j21] [j20] [c2] [j17]
2	John T. Baldwin	[j8]
3	K. Jon Barwise (Jon Barwise)	[j14]
4	Victor L. Bennison	[j11] [c1]
5	S. Barry Cooper	[j18]
6	Barbara F. Csima	[j33] [j31] [j29]
7	David Diamondstone	[j35]
8	Damir D. Dzhafarov	[j35]
9	Robin O. Gandy	[j4]
10	Valentina S. Harizanov	[j33]
11	Leo Harrington	[j28] [j27] [j25] [j18]
12	Denis R. Hirschfeldt	[j33] [j29]
13	Steven Homer	[j21] [c2]
14	Carl G. Jockusch Jr.	[j22] [j19] [j16] [j12] [j7] [j6] [j5]
15	Julia F. Knight	[j29] [j15]
16	Alistair H. Lachlan	[j26] [j23] [j20] [j18] [j15]
17	Karen Lange	[j32]
18	Steffen Lempp	[j18]
19	Manuel Lerman	[j16]
20	Donald A. Martin	[j8]
21	Terrence Millar	[j14]
22	Robert Solovay	[j16]
23	William W. Tait	[j12] [j8]
24	Gaisi Takeuti	[j12]

Robert I. Soare

Coauthor Index