| Publication | Date of Publication | Type |
|---|
| Why Turing’s Thesis Is Not a Thesis | 2018-04-18 | Paper |
| Corrigendum to: ``The d.r.e. degrees are not dense | 2017-09-29 | Paper |
| Formalism and intuition in computability | 2015-08-21 | Paper |
| Turing Computability | 2013-12-06 | Paper |
| \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination | 2010-06-11 | Paper |
| Turing oracle machines, online computing, and three displacements in computability theory | 2009-10-26 | Paper |
| Computability and Incomputability | 2007-11-13 | Paper |
| Computability of homogeneous models | 2007-08-10 | Paper |
| Bounding homogenous models | 2007-03-12 | Paper |
| Computability Results Used in Differential Geometry | 2007-01-19 | Paper |
| Computability Theory and Differential Geometry | 2006-01-12 | Paper |
| Bounding prime models | 2005-08-29 | Paper |
| Extension of embeddings in the computably enumerable degrees | 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 |
| https://portal.mardi4nfdi.de/entity/Q4513979 | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934276 | 2000-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934282 | 2000-06-29 | Paper |
| Definable properties of the computably enumerable sets | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395619 | 1999-02-22 | Paper |
| Codable sets and orbits of computably enumerable sets | 1999-02-07 | Paper |
| Models of arithmetic and subuniform bounds for the arithmetic sets | 1998-12-03 | Paper |
| Computability and Recursion | 1997-05-12 | Paper |
| Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets | 1997-03-19 | Paper |
| The Δ₃⁰-automorphism method and noninvariant classes of degrees | 1996-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863241 | 1996-09-22 | Paper |
| Boolean algebras, Stone spaces, and the iterated Turing jump | 1995-08-27 | Paper |
| Algebraic aspects of the computably enumerable degrees. | 1995-05-16 | Paper |
| The continuity of cupping to \(\text \textbf{0}'\) | 1995-01-29 | Paper |
| Models of arithmetic and upper bounds for arithmetic sets | 1994-11-27 | Paper |
| Minimal pairs and complete problems | 1994-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694275 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4040892 | 1993-06-05 | Paper |
| Post's program and incomplete recursively enumerable sets. | 1993-02-09 | Paper |
| The d.r.e. degrees are not dense | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975929 | 1992-06-26 | Paper |
| Degrees of orderings not isomorphic to recursive linear orderings | 1991-01-01 | Paper |
| Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion | 1989-01-01 | Paper |
| The recursively enumerable degrees have infinitely many one-types | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819052 | 1987-01-01 | Paper |
| Members of countable \(\Pi ^ 0_ 1\) classes | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690802 | 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 | 1984-01-01 | Paper |
| Two theorems on degrees of models of true arithmetic | 1984-01-01 | Paper |
| Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets | 1982-01-01 | Paper |
| Computational complexity of recursively enumerable sets | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657980 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3962983 | 1981-01-01 | Paper |
| Not every finite lattice is embeddable in the recursively enumerable degrees | 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 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3872442 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897039 | 1980-01-01 | Paper |
| Recursively enumerable sets and degrees | 1978-01-01 | Paper |
| Computational complexity, speedable and levelable sets | 1978-01-01 | Paper |
| \(r\)-maximal major subsets | 1978-01-01 | Paper |
| Some lowness properties and computational complexity sequences | 1978-01-01 | Paper |
| The infinite injury priority method | 1976-01-01 | Paper |
| Boolean algebras, splitting theorems, and $Δ^0_2$ sets | 1975-01-01 | Paper |
| Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets | 1974-01-01 | Paper |
| Automorphisms of the lattice of recursively enumerable sets | 1974-01-01 | Paper |
| Isomorphisms on countable vector spaces with recursive operations | 1974-01-01 | Paper |
| Post's problem and his hypersimple set | 1973-01-01 | Paper |
| Encodability of Kleene's O | 1973-01-01 | Paper |
| ∏ 0 1 Classes and Degrees of Theories | 1972-01-01 | Paper |
| Degrees of members of \(\Pi_ 1^ 0\) classes | 1972-01-01 | Paper |
| The Friedberg-Muchnik Theorem Re-Examined | 1972-01-01 | Paper |
| A minimal pair of Π10 classes | 1971-01-01 | Paper |
| Minimal Covers and Arithmetical Sets | 1970-01-01 | Paper |
| A problem in the theory of constructive order types | 1970-01-01 | Paper |
| Sets with no subset of higher degree | 1969-01-01 | Paper |
| Recursion Theory and Dedekind Cuts | 1969-01-01 | Paper |
| Cohesive sets and recursively enumerable Dedekind cuts | 1969-01-01 | Paper |
| Constructive order types on cuts | 1969-01-01 | Paper |
| A note on degrees of subsets1 | 1969-01-01 | Paper |
