Robert Irving Soare

Theory and Applications of Computability, Springer, ISBN: 978-3-642-31933-4, 2016

2014

Turing and the discovery of computability.

[BibT_eX]

[DOI]

Robert Irving Soare

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2010

Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination.

[BibT_eX]

[DOI]

David Diamondstone

Damir D. Dzhafarov

Notre Dame J. Formal Log., 2010

2009

Turing oracle machines, online computing, and three displacements in computability theory.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

2007

Computability of Homogeneous Models.

[BibT_eX]

[DOI]

Karen M. Lange

Notre Dame J. Formal Log., 2007

Bounding homogeneous models.

[BibT_eX]

[DOI]

Barbara F. Csima

Valentina S. Harizanov

Denis R. Hirschfeldt

J. Symb. Log., 2007

Computability and Incomputability.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

Computability results used in differential geometry.

[BibT_eX]

[DOI]

Barbara F. Csima

J. Symb. Log., 2006

2004

Bounding prime models.

[BibT_eX]

[DOI]

J. Symb. Log., 2004

Computability theory and differential geometry.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2004

1999

An Overview of the Computably Enumerable Sets.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computability Theory, 1999

The History and Concept of Computability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Computability Theory, 1999

1998

Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1998

Codable Sets and Orbits of Computably Enumerable Sets.

[BibT_eX]

[DOI]

Leo Harrington

J. Symb. Log., 1998

Definable Properties of the Computably Enumerable Sets.

[BibT_eX]

[DOI]

Leo Harrington

Ann. Pure Appl. Log., 1998

1996

Computability and recursion.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1996

Definability, automorphisms, and dynamic properties of computably enumerable sets.

[BibT_eX]

[DOI]

Leo Harrington

Bull. Symb. Log., 1996

1994

Minimal Pairs and Complete Problems.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Steven Homer

Theor. Comput. Sci., 1994

Models of Arithmetic and Upper Bounds for Arithmetic Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

Boolean Algebras, Stone Spaces, and the Iterated Turing Jump.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

1993

The Continuity of Cupping to 0'.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Ann. Pure Appl. Log., 1993

1991

Degrees of Orderings Not Isomorphic to Recursive Linear Orderings.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1991

The d.r.e. Degrees are Not Dense.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1991

1989

Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.

[BibT_eX]

[DOI]

J. Symb. Log., 1989

The Recursively Enumerable Degrees have Infinitely Many One-Types.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Ann. Pure Appl. Log., 1989

1987

Recursively enumerable sets and degrees - a study of computable functions and computability generated sets.

[BibT_eX]

Perspectives in mathematical logic, Springer, ISBN: 978-3-540-15299-6, 1987

1986

Members of countable π10 classes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1986

1984

Two Theorems on Degrees of Models of True Arithmetic.

[BibT_eX]

[DOI]

Julia F. Knight

J. Symb. Log., 1984

1983

Meeting of the Association for Symbolic Logic: Milwaukee, 1981.

[BibT_eX]

[DOI]

Jon Barwise

Terrence Millar

J. Symb. Log., 1983

1982

Computational Complexity of Recursively Enumerable Sets

[BibT_eX]

[DOI]

Inf. Control., January, 1982

Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.

[BibT_eX]

[DOI]

Ann. Math. Log., 1982

1978

Some Lowness Properties and Computational Complexity Sequences.

[BibT_eX]

[DOI]

Victor L. Bennison

Theor. Comput. Sci., 1978

Meeting of the Association for Symbolic Logic: Chicago, 1977.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

1977

Computational Complexity, Speedable and Levelable Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1977

Recursion Theoretic Characterizations of Complexity Theoretic Properties

[BibT_eX]

[DOI]

Victor L. Bennison

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976

The Infinite Injury Priority Method.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

Meeting of the Association for Symbolic Logic.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

1973

Post's Problem and His Hypersimple Set.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

Encodability of Kleene's O.

[BibT_eX]

[DOI]

J. Symb. Log., 1973

1971

A Minimal Pair of pi01 Classes.

[BibT_eX]

[DOI]

J. Symb. Log., 1971

1970

A Problem in the Theory of Constructive Order Types.

[BibT_eX]

[DOI]

Robin O. Gandy

J. Symb. Log., 1970

1969

Constructive Order Types on Cuts.

[BibT_eX]

[DOI]

J. Symb. Log., 1969

A Note on Degrees of Subsets.

[BibT_eX]

[DOI]

J. Symb. Log., 1969

Sets with no Subset of Higher Degrees.

[BibT_eX]

[DOI]