Robert I. Soare - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2017

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. APAL, 168(12):2164-2165, 2017. [doi]

2016

Turing Computability - Theory and ApplicationsRobert I. Soare. Theory and Applications of Computability, Springer, 2016. [doi]

2010

Pi:::0:::::1:: Classes, Peano Arithmetic, Randomness, and Computable DominationDavid Diamondstone, Damir D. Dzhafarov, Robert I. Soare. ndjfl, 51(1):127-159, 2010. [doi]

2009

Turing oracle machines, online computing, and three displacements in computability theoryRobert I. Soare. APAL, 160(3):368-399, 2009. [doi]

2007

Bounding homogeneous modelsBarbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare. JSYML, 72(1):305-323, 2007. [doi]

Computability of Homogeneous ModelsKaren Lange, Robert I. Soare. ndjfl, 48(1):143-170, 2007. [doi]

Computability and IncomputabilityRobert I. Soare. cie 2007: 705-715 [doi]

2006

Computability results used in differential geometryBarbara F. Csima, Robert I. Soare. JSYML, 71(4):1394-1410, 2006. [doi]

2004

Bounding prime modelsBarbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare. JSYML, 69(4):1117-1142, 2004. [doi]

Computability theory and differential geometryRobert I. Soare. bsl, 10(4):457-486, 2004. [doi]

1999

An Overview of the Computably Enumerable SetsRobert I. Soare. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 199-248, North-Holland, 1999. [doi]

The History and Concept of ComputabilityRobert I. Soare. In Edward R. Griffor, editor, Handbook of Computability Theory. Volume 140 of Studies in Logic and the Foundations of Mathematics, pages 3-36, North-Holland, 1999. [doi]

1998

Definable Properties of the Computably Enumerable SetsLeo Harrington, Robert I. Soare. APAL, 94(1-3):97-125, 1998.

Codable Sets and Orbits of Computably Enumerable SetsLeo Harrington, Robert I. Soare. JSYML, 63(1):1-28, 1998.

Models of Arithmetic and Subuniform Bounds for the Arithmetic SetsAlistair H. Lachlan, Robert I. Soare. JSYML, 63(1):59-72, 1998.

1996

Definability, automorphisms, and dynamic properties of computably enumerable setsLeo Harrington, Robert I. Soare. bsl, 2(2):199-213, 1996. [doi]

Computability and recursionRobert I. Soare. bsl, 2(3):284-321, 1996. [doi]

1994

Minimal Pairs and Complete ProblemsKlaus Ambos-Spies, Steven Homer, Robert I. Soare. TCS, 132(2):229-241, 1994.

Boolean Algebras, Stone Spaces, and the Iterated Turing JumpCarl G. Jockusch Jr., Robert I. Soare. JSYML, 59(4):1121-1138, 1994.

Models of Arithmetic and Upper Bounds for Arithmetic SetsAlistair H. Lachlan, Robert I. Soare. JSYML, 59(3):977-983, 1994.

1993

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

1991

The d.r.e. Degrees are Not DenseS. Barry Cooper, Leo Harrington, Alistair H. Lachlan, Steffen Lempp, Robert I. Soare. APAL, 55(2):125-151, 1991.

Degrees of Orderings Not Isomorphic to Recursive Linear OrderingsCarl G. Jockusch Jr., Robert I. Soare. APAL, 52(1-2):39-64, 1991.

1990

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

1989

The Recursively Enumerable Degrees have Infinitely Many One-TypesKlaus Ambos-Spies, Robert I. Soare. APAL, 44(1-2):1-23, 1989.

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov s Completeness CriterionCarl G. Jockusch Jr., Manuel Lerman, Robert I. Soare, Robert Solovay. JSYML, 54(4):1288-1323, 1989.

1987

Recursively enumerable sets and degrees - a study of computable functions and computability generated setsRobert I. Soare. Perspectives in mathematical logic, Springer, 1987.

1986

0 classesDouglas A. Cenzer, Peter Clote, Rick L. Smith, Robert I. Soare, Stanley S. Wainer. APAL, 31:145-163, 1986. [doi]

1984

Two Theorems on Degrees of Models of True ArithmeticJulia F. Knight, Alistair H. Lachlan, Robert I. Soare. JSYML, 49(2):425-436, 1984.

1983

Meeting of the Association for Symbolic Logic: Milwaukee, 1981Jon Barwise, Robert I. Soare, Terrence Millar. JSYML, 48(2):514-518, 1983.

1982

Computational Complexity of Recursively Enumerable SetsRobert I. Soare. iandc, 52(1):8-18, January 1982.

Automorphisms of the lattice of recursively enumerable sets. Part II: Low setsRobert I. Soare. APAL, 22(1):69-107, 1982. [doi]

1978

Some Lowness Properties and Computational Complexity SequencesVictor L. Bennison, Robert I. Soare. TCS, 6:233-254, 1978.

Meeting of the Association for Symbolic Logic: Chicago, 1977Carl G. Jockusch Jr., Robert I. Soare, William W. Tait, Gaisi Takeuti. JSYML, 43(3):614-619, 1978.

1977

Recursion Theoretic Characterizations of Complexity Theoretic PropertiesVictor L. Bennison, Robert I. Soare. focs 1977: 100-106

Computational Complexity, Speedable and Levelable SetsRobert I. Soare. JSYML, 42(4):545-563, 1977.

1976

Meeting of the Association for Symbolic LogicJohn T. Baldwin, Donald A. Martin, Robert I. Soare, William W. Tait. JSYML, 41(2):551-560, 1976.

The Infinite Injury Priority MethodRobert I. Soare. JSYML, 41(2):513-530, 1976.

1973

Post s Problem and His Hypersimple SetCarl G. Jockusch Jr., Robert I. Soare. JSYML, 38(3):446-452, 1973.

Encodability of Kleene s OCarl G. Jockusch Jr., Robert I. Soare. JSYML, 38(3):437-440, 1973.

1971

A Minimal Pair of pi:::0:::::1:: ClassesCarl G. Jockusch Jr., Robert I. Soare. JSYML, 36(1):66-78, 1971.

1970

A Problem in the Theory of Constructive Order TypesRobin O. Gandy, Robert I. Soare. JSYML, 35(1):119-121, 1970.

1969

Sets with no Subset of Higher DegreesRobert I. Soare. JSYML, 34(1):53-56, 1969.

Constructive Order Types on CutsRobert I. Soare. JSYML, 34(2):285-289, 1969.

A Note on Degrees of SubsetsRobert I. Soare. JSYML, 34(2):256, 1969.

Sign in or sign up to see more results.

runs on WebDSL