| Publication | Date of Publication | Type |
|---|
| Herd immunity under individual variation and reinfection | 2022-07-13 | Paper |
| THE TREE OF TUPLES OF A STRUCTURE | 2022-04-12 | Paper |
| Computable Structure Theory | 2021-07-26 | Paper |
| Punctual definability on structures | 2021-06-14 | Paper |
| Jump inversions of algebraic structures and Σ‐definability | 2020-05-06 | Paper |
| THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH | 2020-04-17 | Paper |
| Martin's Conjecture: A Classification of the Naturally Occurring Turing Degrees | 2019-10-28 | Paper |
| On the structure of the Wadge degrees of bqo-valued Borel functions | 2019-06-05 | Paper |
| BOREL FUNCTORS AND INFINITARY INTERPRETATIONS | 2019-01-04 | Paper |
| Jump inversions of algebraic structures and the \({\Sigma}\)-definability | 2018-11-14 | Paper |
| The uniform Martin’s conjecture for many-one degrees | 2018-10-18 | Paper |
| Coding and definability in computable structures | 2018-09-19 | Paper |
| COMPUTABLE POLISH GROUP ACTIONS | 2018-08-10 | Paper |
| CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC | 2018-08-10 | Paper |
| Fraïssé’s conjecture in Π11-comprehension | 2017-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5371227 | 2017-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5354755 | 2017-09-04 | Paper |
| Sex versus asex: an analysis of the role of variance conversion | 2017-08-21 | Paper |
| COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY | 2017-06-01 | Paper |
| COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS | 2017-04-28 | Paper |
| THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES | 2017-04-28 | Paper |
| Effectively Existentially-Atomic Structures | 2017-04-04 | Paper |
| Degree-invariant, analytic equivalence relations without perfectly many classes | 2016-11-14 | Paper |
| CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS | 2016-05-09 | Paper |
| The strength of Turing determinacy within second order arithmetic | 2016-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464659 | 2016-01-27 | Paper |
| A robuster Scott rank | 2015-11-02 | Paper |
| Independence in computable algebra | 2015-09-25 | Paper |
| Rice sequences of relations | 2015-08-21 | Paper |
| ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE | 2015-05-18 | Paper |
| UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES | 2015-03-06 | Paper |
| PRIORITY ARGUMENTS VIA TRUE STAGES | 2015-03-06 | Paper |
| The limits of determinacy in second order arithmetic: consistency and complexity strength | 2014-12-11 | Paper |
| The complexity of computable categoricity | 2014-11-17 | Paper |
| Boolean algebra approximations | 2014-09-19 | Paper |
| Copyable Structures | 2014-04-04 | Paper |
| RELATIVE TO ANY NON-HYPERARITHMETIC SET | 2013-10-17 | Paper |
| Extensions of embeddings below computably enumerable degrees | 2013-07-08 | Paper |
| A fixed point for the jump operator on structures | 2013-06-24 | Paper |
| K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM | 2013-06-03 | Paper |
| A Cappable Almost Everywhere Dominating Computably Enumerable Degree | 2013-05-10 | Paper |
| A computability theoretic equivalent to Vaught's conjecture | 2013-03-11 | Paper |
| Computing maximal chains | 2012-09-18 | Paper |
| Counting the back-and-forth types | 2012-09-05 | Paper |
| Isomorphism relations on computable structures | 2012-04-19 | Paper |
| The limits of determinacy in second-order arithmetic | 2012-02-24 | Paper |
| On the $n$-back-and-forth types of Boolean algebras | 2012-02-24 | Paper |
| Cuts of linear orders | 2011-12-13 | Paper |
| Open Questions in Reverse Mathematics | 2011-10-11 | Paper |
| The Veblen functions for computability theorists | 2011-06-28 | Paper |
| The Slaman-Wehner theorem in higher recursion theory | 2011-05-27 | Paper |
| Computability of Fraïssé limits | 2011-03-18 | Paper |
| Notes on the Jump of a Structure | 2010-07-28 | Paper |
| A computable ℵ0-categorical structure whose theory computes true arithmetic | 2010-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656430 | 2010-01-13 | Paper |
| On Fraïssé's conjecture for linear orders of finite Hausdorff rank | 2009-10-26 | Paper |
| On the Π1 1 -separation principle | 2008-12-10 | Paper |
| K-trivials are NCR | 2008-12-08 | Paper |
| The isomorphism problem for torsion-free abelian groups is analytic complete | 2008-11-12 | Paper |
| Slender classes | 2008-08-11 | Paper |
| On the triple jump of the set of atoms of a Boolean algebra | 2008-06-27 | Paper |
| Ranked structures and arithmetic transfinite recursion | 2008-01-21 | Paper |
| A Weakly 2-Random Set That Is Not Generalized Low | 2007-11-13 | Paper |
| Subspaces of computable vector spaces | 2007-10-17 | Paper |
| Computable linearizations of well-partial-orderings | 2007-10-12 | Paper |
| On the Equimorphism Types of Linear Orderings | 2007-08-08 | Paper |
| Countably complementable linear orderings | 2007-04-26 | Paper |
| Boolean algebras, Tarski invariants, and index sets | 2006-10-04 | Paper |
| INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS | 2006-09-04 | Paper |
| Equimorphism invariants for scattered linear orderings | 2006-07-06 | Paper |
| Equivalence between Fraïssé's conjecture and Jullien's theorem | 2006-04-28 | Paper |
| There is no ordering on the classes in the generalized high/low hierarchies | 2006-03-21 | Paper |
| A minimal pair of 𝐾-degrees | 2006-02-17 | Paper |
| Up to equimorphism, hyperarithmetic is recursive | 2006-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5703326 | 2005-11-08 | Paper |
| Generalized high degrees have the complementation property | 2005-08-29 | Paper |
| Embedding and coding below a 1-generic degree | 2005-07-06 | Paper |
| Embedding jump upper semilattices into the Turing degrees | 2005-02-09 | Paper |
