| Publication | Date of Publication | Type |
|---|
| ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS | 2023-06-05 | Paper |
| THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS | 2022-04-04 | Paper |
| CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC | 2018-08-10 | Paper |
| On the jumps of the degrees below a recursively enumerable degree | 2018-03-08 | Paper |
| Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem | 2017-10-10 | Paper |
| $$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$ | 2017-04-04 | Paper |
| The strength of the Grätzer-Schmidt theorem | 2017-02-02 | Paper |
| Mass problems and density | 2017-01-10 | Paper |
| The strength of Turing determinacy within second order arithmetic | 2016-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464661 | 2016-01-27 | Paper |
| The limits of determinacy in second order arithmetic: consistency and complexity strength | 2014-12-11 | Paper |
| THE TURING DEGREES BELOW GENERICS AND RANDOMS | 2014-09-30 | Paper |
| The complexity of ascendant sequences in locally nilpotent groups | 2014-05-26 | Paper |
| Low Level Nondelegability Results: Domination and Recursive Enumeration | 2014-01-07 | Paper |
| Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$ | 2013-11-14 | Paper |
| Degrees of categoricity and the hyperarithmetic hierarchy | 2013-04-25 | Paper |
| Computably Enumerable Partial Orders | 2013-01-30 | Paper |
| Computing maximal chains | 2012-09-18 | Paper |
| THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES | 2012-09-06 | Paper |
| Domination, forcing, array nonrecursiveness and relative recursive enumerability | 2012-04-19 | Paper |
| The limits of determinacy in second-order arithmetic | 2012-02-24 | Paper |
| The maximal linear extension theorem in second order arithmetic | 2011-08-16 | Paper |
| Topological aspects of the Medvedev lattice | 2011-05-11 | Paper |
| Reverse Mathematics: The Playground of Logic | 2010-10-26 | Paper |
| The strength of the Grätzer-Schmidt theorem | 2010-07-28 | Paper |
| Lattice initial segments of the hyperdegrees | 2010-03-15 | Paper |
| The atomic model theorem and type omitting | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530404 | 2008-10-20 | Paper |
| DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP | 2008-08-26 | Paper |
| Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond | 2007-10-22 | Paper |
| The settling-time reducibility ordering | 2007-10-17 | Paper |
| Combinatorial principles weaker than Ramsey's Theorem for pairs | 2007-03-12 | Paper |
| Degree Structures: Local and Global Investigations | 2006-12-06 | Paper |
| Boolean algebras, Tarski invariants, and index sets | 2006-10-04 | Paper |
| THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES | 2006-09-04 | Paper |
| A computably stable structure with no Scott family of finitary formulas | 2006-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477365 | 2006-07-03 | Paper |
| Invariants, Boolean algebras and ACA₀⁺ | 2005-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5711880 | 2005-12-08 | Paper |
| The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent | 2005-08-30 | Paper |
| Π11 relations and paths through | 2005-08-29 | Paper |
| Generalized high degrees have the complementation property | 2005-08-29 | Paper |
| A computably categorical structure whose expansion by a constant has infinite computable dimension | 2005-02-09 | Paper |
| Decomposition and infima in the computably enumerable degrees | 2005-02-09 | Paper |
| The ∀∃-theory of ℛ(≤,∨,∧) is undecidable | 2004-08-13 | Paper |
| Reasoning about common knowledge with infinitely many agents | 2004-08-06 | Paper |
| Minimal degrees which are Σ₂⁰ but not Δ₂⁰ | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428702 | 2003-09-22 | Paper |
| Degree spectra and computable dimensions in algebraic structures | 2002-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776819 | 2002-05-15 | Paper |
| Every incomplete computably enumerable truth-table degree is branching | 2002-03-21 | Paper |
| Undecidability and 1-types in intervals of the computably enumerable degrees | 2001-10-23 | Paper |
| A splitting theorem for $n-REA$ degrees | 2001-10-21 | Paper |
| The Prospects for Mathematical Logic in the Twenty-First Century | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946105 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513977 | 2000-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934281 | 2000-11-07 | Paper |
| Defining the Turing jump | 2000-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938557 | 2000-07-24 | Paper |
| Computably categorical structures and expansions by constants | 2000-01-09 | Paper |
| Splitting theorems and the jump operator | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217601 | 1999-10-28 | Paper |
| Computable isomorphisms, degree spectra of relations, and Scott families | 1999-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381407 | 1998-10-19 | Paper |
| Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability} | 1998-09-09 | Paper |
| Interpretability and Definability in the Recursively Enumerable Degrees | 1998-08-11 | Paper |
| Computable models of theories with few models | 1998-05-04 | Paper |
| Definability in the Recursively Enumerable Degrees | 1997-11-05 | Paper |
| There is no degree invariant half-jump | 1997-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3125203 | 1997-03-17 | Paper |
| Interpolating \(d\)-r.e. and REA degrees between r.e. degrees | 1997-02-09 | Paper |
| Jumps of Minimal Degrees Below 0 ′ | 1996-12-12 | Paper |
| Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree | 1996-10-28 | Paper |
| Degree theoretic definitions of the low2 recursively enumerable sets | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863238 | 1996-06-19 | Paper |
| Interpreting true arithmetic in the theory of the r.e. truth table degrees | 1996-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764120 | 1995-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4846259 | 1995-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4835608 | 1995-07-03 | Paper |
| Highness and bounding minimal pairs | 1994-08-31 | Paper |
| Undecidability and 1-types in the recursively enumerable degrees | 1994-06-05 | Paper |
| Working below a high recursively enumerable degree | 1994-01-19 | Paper |
| The \(n\)-rea enumeration degrees are dense | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694290 | 1993-06-29 | Paper |
| Countable thin \(\Pi^0_1\) classes | 1993-05-16 | Paper |
| The theory of the recursively enumerable weak truth-table degrees is undecidable | 1993-04-01 | Paper |
| On the strength of König's duality theorem for infinite bipartite graphs | 1992-09-27 | Paper |
| The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972123 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3353006 | 1991-01-01 | Paper |
| Undecidability and initial segments of the (r.e.) tt-degrees | 1990-01-01 | Paper |
| Working below a \(low_ 2\) recursively enumerable degree | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3496330 | 1990-01-01 | Paper |
| Initial segments of the degrees of constructibility | 1988-01-01 | Paper |
| A non-inversion theorem for the jump operator | 1988-01-01 | Paper |
| Infima of recursively enumerable truth table degrees | 1988-01-01 | Paper |
| Decidability and Invariant Classes for Degree Structures | 1988-01-01 | Paper |
| Defining Jump Classes in the Degrees Below 0' | 1988-01-01 | Paper |
| Initial segments of the degrees of size \(\aleph _ 1\) | 1986-01-01 | Paper |
| The Degrees of Constructibility of Cohen Reals | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690804 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3724316 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3755447 | 1985-01-01 | Paper |
| The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical | 1984-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 |
| Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3701411 | 1984-01-01 | Paper |
| The arithmetic and Turing degrees are not elementarily equivalent | 1984-01-01 | Paper |
| Pseudo Jump Operators. I: The R. E. Case | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329451 | 1982-01-01 | Paper |
| On homogeneity and definability in the first-order theory of the Turing degrees | 1982-01-01 | Paper |
| Finitely Generated Codings and the Degrees R.E. in a Degree d | 1982-01-01 | Paper |
| Splitting properties and jump classes | 1981-01-01 | Paper |
| Definable degrees and automorphisms of 𝒟 | 1981-01-01 | Paper |
| The Theory of the Degrees below 0 ′ | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929728 | 1981-01-01 | Paper |
| L ∗ (K) and Other Lattices of Recursively Enumerable Sets | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3910515 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916564 | 1980-01-01 | Paper |
| Reducibility orderings: Theories, definability and automorphisms | 1980-01-01 | Paper |
| The homogeneity conjecture | 1979-01-01 | Paper |
| \(r\)-maximal major subsets | 1978-01-01 | Paper |
| Some More Minimal Pairs of α‐Recursively Enumerable Degrees | 1978-01-01 | Paper |
| Controlling the dependence degree of a recursively enumerable vector space | 1978-01-01 | Paper |
| Nowhere simple sets and the lattice of recursively enumerable sets | 1978-01-01 | Paper |
| Determining Automorphisms of the Recursively Enumerable Sets | 1977-01-01 | Paper |
| On the Jump of an α-Recursively Enumerable Set | 1976-01-01 | Paper |
| Types of simple α-recursively enumerable sets | 1976-01-01 | Paper |
| The recursively enumerable α-degrees are dense | 1976-01-01 | Paper |
| The irregular and non-hyperregular \(\alpha\)-r.e. degrees | 1975-01-01 | Paper |
| Splitting an α-Recursively Enumerable Set | 1975-01-01 | Paper |
| Square bracket partition relations in L | 1974-01-01 | Paper |
| Cohesive Sets: Countable and Uncountable | 1974-01-01 | Paper |
| Σn sets which are Δn-incomparable (uniformly) | 1974-01-01 | Paper |
| Weak compactness and square bracket partition relations | 1973-01-01 | Paper |
| Minimal α-degrees | 1972-01-01 | Paper |
| On large cardinals and partition relations | 1971-01-01 | Paper |
