| Publication | Date of Publication | Type |
|---|
| MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY | 2023-09-11 | Paper |
| Extensions of two constructions of Ahmad | 2023-01-12 | Paper |
| Computability and the Symmetric Difference Operator | 2022-07-22 | Paper |
| On the isomorphism problem for some classes of computable algebraic structures | 2022-07-15 | Paper |
| The first-order theory of the computably enumerable equivalence relations in the uncountable setting | 2022-02-08 | Paper |
| Building models of strongly minimal theories | 2021-07-05 | Paper |
| Fragments of the theory of the enumeration degrees | 2021-04-23 | Paper |
| On the order dimension of locally countable partial orderings | 2020-05-27 | Paper |
| Reductions between types of numberings | 2019-10-07 | Paper |
| On cototality and the skip operator in the enumeration degrees | 2019-07-03 | Paper |
| Interval dismantlable lattices | 2018-04-10 | Paper |
| Corrigendum: "On the complexity of the successivity relation in computable linear orderings" | 2017-12-04 | Paper |
| Corrigendum to: ``The d.r.e. degrees are not dense | 2017-09-29 | Paper |
| Theory spectra and classes of theories | 2017-06-14 | Paper |
| Kenneth Kunen, The Foundations of Mathematics, Studies in Logic, Mathematical Logic and Foundations, vol. 19. College Publications, London, 2009, vii + 251 pp. | 2017-05-26 | Paper |
| THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES | 2017-04-28 | Paper |
| Nondensity of Double Bubbles in the D.C.E. Degrees | 2017-04-04 | Paper |
| On Kalimullin pairs | 2016-07-25 | Paper |
| Defining totality in the enumeration degrees | 2016-07-25 | Paper |
| Asymptotic density, computable traceability, and 1-randomness | 2016-07-08 | Paper |
| On the existence of a strong minimal pair | 2015-08-14 | Paper |
| On the structure of the degrees of relative provability | 2015-06-26 | Paper |
| COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY | 2015-05-20 | Paper |
| COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA | 2015-05-20 | Paper |
| A survey of results on the d.c.e. and \(n\)-c.e. degrees | 2015-03-17 | Paper |
| Lowness for effective Hausdorff dimension | 2015-03-03 | Paper |
| The complexity of computable categoricity | 2014-11-17 | Paper |
| UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS | 2014-09-30 | Paper |
| Random strings and tt-degrees of Turing complete C.E. sets | 2014-09-30 | Paper |
| Computable categoricity versus relative computable categoricity | 2013-05-10 | Paper |
| Downward closure of depth in countable Boolean algebras | 2012-11-27 | Paper |
| ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS | 2011-10-24 | Paper |
| On Downey's conjecture | 2010-06-24 | Paper |
| On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics | 2010-03-31 | Paper |
| Comparing notions of randomness | 2010-02-05 | Paper |
| On computable self-embeddings of computable linear orderings | 2010-01-07 | Paper |
| A decomposition of the Rogers semilattice of a family of d.c.e. sets | 2009-06-04 | Paper |
| Stability and posets | 2009-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530389 | 2008-10-20 | Paper |
| The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs | 2008-10-20 | Paper |
| Ideals in computable rings | 2007-10-17 | Paper |
| Subspaces of computable vector spaces | 2007-10-17 | Paper |
| On the computability-theoretic complexity of trivial, strongly minimal models | 2007-09-27 | Paper |
| Filters on computable posets | 2007-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5295696 | 2007-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494233 | 2006-10-17 | Paper |
| ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS | 2006-04-06 | Paper |
| Computable categoricity of trees of finite height | 2006-02-08 | Paper |
| COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS | 2005-09-12 | Paper |
| Comparing DNR and WWKL | 2005-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677692 | 2005-05-12 | Paper |
| Computability-theoretic and proof-theoretic aspects of partial and linear orderings | 2004-03-17 | Paper |
| Trivial, strongly minimal theories are model complete after naming constants | 2003-09-10 | Paper |
| Group theoretic properties of the group of computable automorphisms of a countable dense linear order | 2003-06-09 | Paper |
| The computable dimension of ordered abelian groups | 2003-05-27 | Paper |
| THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS | 2003-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2784783 | 2003-02-16 | Paper |
| Embedding finite lattices into the Σ20 enumeration degrees | 2002-10-29 | Paper |
| A Δ20 set with no infinite low subset in either it or its complement | 2002-07-18 | Paper |
| On the filter of computably enumerable supersets of an r-maximal set | 2001-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521130 | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946096 | 2000-12-17 | Paper |
| A set with barely degree | 2000-12-17 | Paper |
| Constructive models of uncountably categorical theories | 1999-10-28 | Paper |
| Infima in the recursively enumerable weak truth table degrees | 1999-04-08 | Paper |
| Initial segments of recursive linear orders | 1999-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218120 | 1999-03-02 | Paper |
| Iterated trees of strategies and priority arguments | 1998-11-02 | Paper |
| Contiguity and distributivity in the enumerable Turing degrees | 1998-10-19 | Paper |
| The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable | 1998-09-10 | Paper |
| The computational complexity of torsion-freeness of finitely presented groups | 1998-05-29 | Paper |
| A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees | 1998-03-23 | Paper |
| Infinite versions of some problems from finite complexity theory | 1998-03-12 | Paper |
| Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices | 1997-06-03 | Paper |
| The decidability of the existential theory of the poset of recursively enumerable degrees with jump relations | 1997-02-24 | 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 |
| An extended Lachlan splitting theorem | 1996-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863238 | 1996-06-19 | Paper |
| The undecidability of the Π4-theory for the r.e. wtt and Turing degrees | 1996-06-13 | Paper |
| A General Framework for Priority Arguments | 1995-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325778 | 1995-08-27 | Paper |
| Highness and bounding minimal pairs | 1994-08-31 | Paper |
| There is no plus-capping degree | 1994-07-07 | Paper |
| Lattice Embeddings into the R.E. Degrees Preserving 0 and 1 | 1994-04-27 | Paper |
| The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility | 1993-04-01 | Paper |
| The d.r.e. degrees are not dense | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3480023 | 1990-01-01 | Paper |
| Jumps of nontrivial splittings of recursively enumerable sets | 1990-01-01 | Paper |
| Weak density and cupping in the d-r.e. degrees | 1989-01-01 | Paper |
| A limit on relative genericity in the recursively enumerable sets | 1989-01-01 | Paper |
| A high strongly noncappable degree | 1988-01-01 | Paper |
| Hyperarithmetical Index Sets in Recursion Theory | 1987-01-01 | Paper |
