Robert I. Soare

MaRDI QIDQ207673zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Why Turing’s Thesis Is Not a Thesis Turing’s Revolution	2018-04-18	Paper
Corrigendum to: ``The d.r.e. degrees are not dense Annals of Pure and Applied Logic	2017-09-29	Paper
Formalism and intuition in computability Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences	2015-08-21	Paper
Turing computability. Theory and applications Theory and Applications of Computability	2013-12-06	Paper
$\Pi_1^0$ classes, Peano arithmetic, randomness, and computable domination Notre Dame Journal of Formal Logic	2010-06-11	Paper
Turing oracle machines, online computing, and three displacements in computability theory Annals of Pure and Applied Logic	2009-10-26	Paper
Computability and Incomputability Lecture Notes in Computer Science	2007-11-13	Paper
Computability of homogeneous models Notre Dame Journal of Formal Logic	2007-08-10	Paper
Bounding homogenous models Journal of Symbolic Logic	2007-03-12	Paper
Computability Results Used in Differential Geometry Journal of Symbolic Logic	2007-01-19	Paper
Computability Theory and Differential Geometry The Bulletin of Symbolic Logic	2006-01-12	Paper
Bounding prime models Journal of Symbolic Logic	2005-08-29	Paper
Extension of embeddings in the computably enumerable degrees Annals of Mathematics. Second Series	2002-02-14	Paper
Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov.	2001-09-03	Paper
scientific article; zbMATH DE number 1531936 (Why is no real title available?)	2001-07-09	Paper
scientific article; zbMATH DE number 1390011 (Why is no real title available?)	2000-11-14	Paper
scientific article; zbMATH DE number 1390017 (Why is no real title available?)	2000-06-29	Paper
Definable properties of the computably enumerable sets Annals of Pure and Applied Logic	2000-01-12	Paper
scientific article; zbMATH DE number 1163992 (Why is no real title available?)	1999-02-22	Paper
Codable sets and orbits of computably enumerable sets Journal of Symbolic Logic	1999-02-07	Paper
Models of arithmetic and subuniform bounds for the arithmetic sets Journal of Symbolic Logic	1998-12-03	Paper
Computability and Recursion The Bulletin of Symbolic Logic	1997-05-12	Paper
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets The Bulletin of Symbolic Logic	1997-03-19	Paper
The Δ₃⁰-automorphism method and noninvariant classes of degrees Journal of the American Mathematical Society	1996-12-11	Paper
scientific article; zbMATH DE number 841085 (Why is no real title available?)	1996-09-22	Paper
Boolean algebras, Stone spaces, and the iterated Turing jump Journal of Symbolic Logic	1995-08-27	Paper
Algebraic aspects of the computably enumerable degrees. Proceedings of the National Academy of Sciences	1995-05-16	Paper
The continuity of cupping to $\text \textbf{0}'$ Annals of Pure and Applied Logic	1995-01-29	Paper
Models of arithmetic and upper bounds for arithmetic sets Journal of Symbolic Logic	1994-11-27	Paper
Minimal pairs and complete problems Theoretical Computer Science	1994-09-25	Paper
scientific article; zbMATH DE number 218585 (Why is no real title available?)	1993-06-29	Paper
scientific article; zbMATH DE number 194103 (Why is no real title available?)	1993-06-05	Paper
Post's program and incomplete recursively enumerable sets. Proceedings of the National Academy of Sciences	1993-02-09	Paper
The d.r.e. degrees are not dense Annals of Pure and Applied Logic	1992-06-28	Paper
scientific article; zbMATH DE number 18526 (Why is no real title available?)	1992-06-26	Paper
Degrees of orderings not isomorphic to recursive linear orderings Annals of Pure and Applied Logic	1991-01-01	Paper
Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion Journal of Symbolic Logic	1989-01-01	Paper
The recursively enumerable degrees have infinitely many one-types Annals of Pure and Applied Logic	1989-01-01	Paper
scientific article; zbMATH DE number 4091484 (Why is no real title available?)	1987-01-01	Paper
Members of countable $\Pi ^ 0_ 1$ classes Annals of Pure and Applied Logic	1986-01-01	Paper
scientific article; zbMATH DE number 3914304 (Why is no real title available?)	1985-01-01	Paper
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees	1984-01-01	Paper
The elementary theory of the recursively enumerable degrees is not $\aleph _ 0$-categorical Advances in Mathematics	1984-01-01	Paper
Two theorems on degrees of models of true arithmetic Journal of Symbolic Logic	1984-01-01	Paper
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets Annals of Mathematical Logic	1982-01-01	Paper
Computational complexity of recursively enumerable sets Information and Control	1982-01-01	Paper
scientific article; zbMATH DE number 3809539 (Why is no real title available?)	1982-01-01	Paper
scientific article; zbMATH DE number 3784859 (Why is no real title available?)	1981-01-01	Paper
Not every finite lattice is embeddable in the recursively enumerable degrees Advances in Mathematics	1980-01-01	Paper
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets	1980-01-01	Paper
d-simple sets, small sets, and degree classes Pacific Journal of Mathematics	1980-01-01	Paper
scientific article; zbMATH DE number 3675871 (Why is no real title available?)	1980-01-01	Paper
scientific article; zbMATH DE number 3704566 (Why is no real title available?)	1980-01-01	Paper
Recursively enumerable sets and degrees Bulletin of the American Mathematical Society	1978-01-01	Paper
Computational complexity, speedable and levelable sets Journal of Symbolic Logic	1978-01-01	Paper
$r$-maximal major subsets Israel Journal of Mathematics	1978-01-01	Paper
Some lowness properties and computational complexity sequences Theoretical Computer Science	1978-01-01	Paper
The infinite injury priority method Journal of Symbolic Logic	1976-01-01	Paper
Boolean algebras, splitting theorems, and $Δ^0_2$ sets Fundamenta Mathematicae	1975-01-01	Paper
Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets Annals of Mathematics. Second Series	1974-01-01	Paper
Automorphisms of the lattice of recursively enumerable sets Bulletin of the American Mathematical Society	1974-01-01	Paper
Isomorphisms on countable vector spaces with recursive operations Journal of the Australian Mathematical Society	1974-01-01	Paper
Post's problem and his hypersimple set Journal of Symbolic Logic	1973-01-01	Paper
Encodability of Kleene's O Journal of Symbolic Logic	1973-01-01	Paper
∏ 0 1 Classes and Degrees of Theories Transactions of the American Mathematical Society	1972-01-01	Paper
Degrees of members of $\Pi_ 1^ 0$ classes Pacific Journal of Mathematics	1972-01-01	Paper
The Friedberg-Muchnik Theorem Re-Examined Canadian Journal of Mathematics	1972-01-01	Paper
A minimal pair of Π₁⁰ classes Journal of Symbolic Logic	1971-01-01	Paper
Minimal Covers and Arithmetical Sets	1970-01-01	Paper
A problem in the theory of constructive order types Journal of Symbolic Logic	1970-01-01	Paper
Sets with no subset of higher degree Journal of Symbolic Logic	1969-01-01	Paper
Recursion Theory and Dedekind Cuts Transactions of the American Mathematical Society	1969-01-01	Paper
Cohesive sets and recursively enumerable Dedekind cuts Pacific Journal of Mathematics	1969-01-01	Paper
Constructive order types on cuts Journal of Symbolic Logic	1969-01-01	Paper
A note on degrees of subsets¹ Journal of Symbolic Logic	1969-01-01	Paper

Research outcomes over time

This page was built for person: Robert I. Soare