| Publication | Date of Publication | Type |
|---|
| A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF | 2024-02-23 | Paper |
| Direct construction of Scott ideals | 2024-01-12 | Paper |
| Computability for the absolute Galois group of $\mathbb{Q}$ | 2023-07-17 | Paper |
| Differentially closed fields and universality on a cone | 2023-01-13 | Paper |
| Effectivizing Lusin’s Theorem | 2023-01-09 | Paper |
| Non-coding enumeration operators | 2022-12-16 | Paper |
| INTERPRETING A FIELD IN ITS HEISENBERG GROUP | 2022-08-29 | Paper |
| HTP-COMPLETE RINGS OF RATIONAL NUMBERS | 2022-04-12 | Paper |
| Computable procedures for fields | 2022-03-22 | Paper |
| On existential definitions of c.e. subsets of rings of functions of characteristic 0 | 2022-03-03 | Paper |
| Model completeness and relative decidability | 2021-07-21 | Paper |
| Computable Reducibility for Cantor Space | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5150975 | 2021-02-16 | Paper |
| MEASURE THEORY AND HILBERT’S TENTH PROBLEM INSIDE ℚ | 2020-12-02 | Paper |
| On decidable categoricity and almost prime models | 2020-10-06 | Paper |
| Forcing as a computational process | 2020-07-01 | Paper |
| Interpreting a field in its Heisenberg group | 2020-06-21 | Paper |
| Degree spectra for transcendence in fields | 2020-05-12 | Paper |
| Turing degrees of complete formulas of almost prime models | 2020-02-28 | Paper |
| Isomorphism and classification for countable structures | 2020-01-17 | Paper |
| Primitive recursive fields and categoricity | 2019-12-06 | Paper |
| Effectivizing Lusin's Theorem | 2019-08-17 | Paper |
| The Hilbert's-tenth-problem operator | 2019-05-17 | Paper |
| Degree spectra of real closed fields | 2019-03-27 | Paper |
| Model completeness and relative decidability | 2019-03-02 | Paper |
| BOREL FUNCTORS AND INFINITARY INTERPRETATIONS | 2019-01-04 | Paper |
| A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS | 2018-05-02 | Paper |
| Classifications of computable structures | 2018-03-08 | Paper |
| On Computable Field Embeddings and Difference Closed Fields | 2017-12-13 | Paper |
| As easy as $\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields | 2017-10-11 | Paper |
| Computable transformations of structures | 2017-08-04 | Paper |
| TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS | 2017-06-01 | Paper |
| COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY | 2017-06-01 | Paper |
| Approximating functions and measuring distance on a graph | 2017-05-31 | Paper |
| FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS | 2017-04-28 | Paper |
| Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey | 2017-04-04 | Paper |
| Baire Category Theory and Hilbert’s Tenth Problem Inside $$\mathbb {Q}$$ Q | 2016-08-17 | Paper |
| Borel Functors and Infinitary Interpretations | 2016-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464658 | 2016-01-27 | Paper |
| Computable categoricity for algebraic fields with splitting algorithms | 2015-04-22 | Paper |
| Categoricity properties for computable algebraic fields | 2015-04-22 | Paper |
| Isomorphisms of Non-Standard Fields and Ash’s Conjecture | 2015-02-25 | Paper |
| On the Effectiveness of Symmetry Breaking | 2015-02-25 | Paper |
| COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY | 2014-12-05 | Paper |
| Computing constraint sets for differential fields | 2014-08-28 | Paper |
| Classes of structures with universe a subset of 1 | 2014-04-01 | Paper |
| Computably Categorical Fields via Fermat’s Last Theorem | 2013-10-10 | Paper |
| Local Computability for Ordinals | 2013-08-05 | Paper |
| The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility | 2013-01-30 | Paper |
| An introduction to computable model theory on groups and fields | 2012-05-07 | Paper |
| The Distance Function on a Computable Graph | 2011-11-10 | Paper |
| Low5 Boolean Subalgebras and Computable Copies | 2011-10-10 | Paper |
| Adapting Rabin’s Theorem for Differential Fields | 2011-09-09 | Paper |
| Noncomputable functions in the Blum-Shub-Smale model | 2011-05-26 | Paper |
| Computability of Fraïssé limits | 2011-03-18 | Paper |
| Is it harder to factor a polynomial or to find a root? | 2010-10-29 | Paper |
| Simple structures with complex symmetry | 2010-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3588177 | 2010-09-10 | Paper |
| The basic theory of infinite time register machines | 2010-03-02 | Paper |
| Degrees of categoricity of computable structures | 2010-01-22 | Paper |
| d-computable categoricity for algebraic fields | 2010-01-07 | Paper |
| Post's problem for ordinal register machines: an explicit approach | 2009-10-26 | Paper |
| Real Computable Manifolds and Homotopy Groups | 2009-10-22 | Paper |
| An Enhanced Theory of Infinite Time Register Machines | 2008-06-19 | Paper |
| Perfect Local Computability and Computable Simulations | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384986 | 2008-04-29 | Paper |
| Order-computable sets | 2008-02-05 | Paper |
| Post’s Problem for Ordinal Register Machines | 2007-11-13 | Paper |
| The Complexity of Quickly ORM-Decidable Sets | 2007-11-13 | Paper |
| Locally Computable Structures | 2007-11-13 | Paper |
| Spectra of structures and relations | 2007-03-12 | Paper |
| The Computable Dimension of I-Trees of Infinite Height | 2006-07-18 | Paper |
| Enumerations in computable structure theory | 2005-10-26 | Paper |
| The ∀∃-theory of ℛ(≤,∨,∧) is undecidable | 2004-08-13 | Paper |
| Definable incompleteness and Friedberg splittings | 2003-05-29 | Paper |
| Orbits of computably enumerable sets: Low sets can avoid an upper cone | 2002-12-02 | Paper |
| The -spectrum of a linear order | 2002-09-05 | Paper |
