| Publication | Date of Publication | Type |
|---|
| Recursion theoretic papers. Introduction to Part VI | 2020-03-09 | Paper |
| Corrigendum to: ``The d.r.e. degrees are not dense | 2017-09-29 | Paper |
| $$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$ | 2017-04-04 | Paper |
| On the orbits of computably enumerable sets | 2010-11-19 | Paper |
| The Complexity of Orbits of Computably Enumerable Sets | 2008-05-08 | Paper |
| Extension theorems, orbits, and automorphisms of the computably enumerable sets | 2008-01-21 | Paper |
| On the Orbits of Computably Enumerable Sets | 2006-07-11 | Paper |
| Isomorphisms of splits of computably enumerable sets | 2005-02-09 | Paper |
| Definable Encodings in the Computably Enumerable Sets | 2002-01-09 | Paper |
| ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS | 2002-01-01 | Paper |
| Definable properties of the computably enumerable sets | 2000-01-12 | Paper |
| Codable sets and orbits of computably enumerable sets | 1999-02-07 | Paper |
| Coding in the partial order of enumerable sets | 1998-03-31 | Paper |
| Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets | 1997-03-19 | Paper |
| There is no fat orbit | 1997-03-17 | Paper |
| The Δ₃⁰-automorphism method and noninvariant classes of degrees | 1996-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863241 | 1996-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694275 | 1993-06-29 | 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 |
| A Glimm-Effros Dichotomy for Borel Equivalence Relations | 1992-06-25 | Paper |
| Borel Orderings | 1988-01-01 | Paper |
| Trivial pursuit: remarks on the main gap | 1987-01-01 | Paper |
| \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures | 1985-01-01 | Paper |
| Some exact equiconsistency results in set theory | 1985-01-01 | Paper |
| An exposition of Shelah's 'main gap': counting uncountable models of \(\omega\)-stable and superstable theories | 1985-01-01 | Paper |
| Fundamentals of forking | 1984-01-01 | Paper |
| A proof of Vaught's conjecture for \(\omega\)-stable theories | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3342515 | 1984-01-01 | Paper |
| The undecidability of the recursively enumerable degrees | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657983 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3041186 | 1982-01-01 | Paper |
| On the determinacy of games on ordinals | 1981-01-01 | Paper |
| Definable degrees and automorphisms of 𝒟 | 1981-01-01 | Paper |
| Extensions of countable infinitary logic which preserve most of its nice properties | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3671147 | 1979-01-01 | Paper |
| Models Without Indiscernibles | 1978-01-01 | Paper |
| Analytic determinacy and 0# | 1978-01-01 | Paper |
| A Generalized Kleene-Moschovakis Theorem | 1978-01-01 | Paper |
| Long projective wellorderings | 1977-01-01 | Paper |
| Flipping properties: A unifying thread in the theory of large cardinals | 1977-01-01 | Paper |
| $Π^1_2$ singletons and $O^#$ | 1977-01-01 | Paper |
| Adding a closed unbounded set | 1976-01-01 | Paper |
| On Σ1 well-orderings of the universe | 1976-01-01 | Paper |
| On monotone vs. nonmonotone induction | 1976-01-01 | Paper |
| Selection in abstract recursion theory | 1976-01-01 | Paper |
| Characterizing C 3 (The Largest Countable Π 1 3 Set) | 1976-01-01 | Paper |
| Π 1 2 Sets and Π 1 2 Singletons | 1975-01-01 | Paper |
| A Basis Result for ∑ 0 3 Sets of Reals with an Application to Minimal Covers | 1975-01-01 | Paper |
| On characterizing Spector classes | 1975-01-01 | Paper |
| Recursively presentable prime models | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4043076 | 1974-01-01 | Paper |
