| Publication | Date of Publication | Type |
|---|
| The Ginsburg-Sands theorem and computability theory | 2024-04-24 | Paper |
| The tree pigeonhole principle in the Weihrauch degrees | 2023-12-16 | Paper |
| On the first-order parts of problems in the Weihrauch degrees | 2023-01-30 | Paper |
| On the isomorphism problem for some classes of computable algebraic structures | 2022-07-15 | Paper |
| Effectiveness for the dual Ramsey theorem | 2022-02-14 | Paper |
| Model completeness and relative decidability | 2021-07-21 | Paper |
| Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees | 2020-06-19 | Paper |
| Lowness for isomorphism, countable ideals, and computable traceability | 2020-05-29 | Paper |
| THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH | 2020-04-17 | Paper |
| The reverse mathematics of Hindman’s Theorem for sums of exactly two elements | 2020-01-17 | Paper |
| Model completeness and relative decidability | 2019-03-02 | Paper |
| Effectiveness for the Dual Ramsey Theorem | 2017-09-29 | Paper |
| The uniform content of partial and linear orders | 2017-08-29 | Paper |
| Effectiveness of Hindman’s Theorem for Bounded Sums | 2017-04-04 | Paper |
| Ramsey’s theorem for singletons and strong computable reducibility | 2016-12-29 | Paper |
| Computable Reductions and Reverse Mathematics | 2016-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464625 | 2016-01-27 | Paper |
| On the Effectiveness of Symmetry Breaking | 2015-02-25 | Paper |
| Degrees that Are Low for Isomorphism | 2015-02-24 | Paper |
| SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS | 2014-03-10 | Paper |
| Degrees of orders on torsion-free abelian groups | 2013-11-29 | Paper |
| Local Computability for Ordinals | 2013-08-05 | Paper |
| CAPPABLE CEA SETS AND RAMSEY'S THEOREM | 2013-06-03 | Paper |
| Jump degrees of torsion-free abelian groups | 2013-01-07 | Paper |
| Lowness notions, measure and domination | 2012-06-08 | Paper |
| Reverse mathematics and infinite traceable graphs | 2012-02-29 | Paper |
| The complexity of central series in nilpotent computable groups | 2011-09-22 | Paper |
| Embeddings of computable structures | 2010-06-11 | Paper |
| Self-embeddings of computable trees | 2010-01-13 | Paper |
| Stability and posets | 2009-06-04 | Paper |
| On the computability-theoretic complexity of trivial, strongly minimal models | 2007-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5295698 | 2007-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494233 | 2006-10-17 | Paper |
| A computably stable structure with no Scott family of finitary formulas | 2006-09-04 | Paper |
| On a conjecture of Dobrinen and Simpson concerning almost everywhere domination | 2006-07-05 | Paper |
| Computable categoricity of trees of finite height | 2006-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5711881 | 2005-12-08 | Paper |
| Enumerations in computable structure theory | 2005-10-26 | Paper |
| Reverse mathematics and the equivalence of definitions for well and better quasi-orders | 2005-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677692 | 2005-05-12 | Paper |
| Effectiveness for infinite variable words and the dual Ramsey theorem | 2004-12-16 | Paper |
| Computability-theoretic and proof-theoretic aspects of partial and linear orderings | 2004-03-17 | 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 |
| \(\Pi_{1}^{0}\) classes and orderable groups | 2002-08-22 | Paper |
| A \(\Delta_2^0\) 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 |
| \(\Pi_1^1\)-CA\(_0\) and order types of countable ordered groups | 2001-08-01 | Paper |
| Reverse mathematics and fully ordered groups | 2001-07-17 | Paper |
| Ordered Groups: A Case Study in Reverse Mathematics | 1999-09-12 | Paper |
