| Publication | Date of Publication | Type |
|---|
| Computability in infinite Galois theory and algorithmically random algebraic fields | 2024-11-20 | Paper |
| In memory of Martin Davis | 2024-09-26 | Paper |
| Cohesive powers of structures | 2024-07-02 | Paper |
| Generically Computable abelian groups | 2024-01-12 | Paper |
| Computability in infinite Galois theory and algorithmically random algebraic fields | 2023-12-07 | Paper |
| ON COHESIVE POWERS OF LINEAR ORDERS | 2023-09-11 | Paper |
| Cohesive Powers of Structures | 2023-04-06 | Paper |
| Generically and coarsely computable isomorphisms | 2023-01-12 | Paper |
| Densely computable structures | 2022-09-08 | Paper |
| INTERPRETING A FIELD IN ITS HEISENBERG GROUP | 2022-08-29 | Paper |
| On the isomorphism problem for some classes of computable algebraic structures | 2022-07-15 | Paper |
| Computability and Definability | 2021-06-15 | Paper |
| Turing degrees and automorphism groups of substructure lattices | 2020-12-03 | Paper |
| GROUPS WITH ORDERINGS OF ARBITRARY ALGORITHMIC COMPLEXITY | 2020-12-02 | Paper |
| On decidable categoricity and almost prime models | 2020-10-06 | Paper |
| Interpreting a field in its Heisenberg group | 2020-06-21 | Paper |
| Cohesive powers of linear orders | 2020-05-12 | Paper |
| Turing degrees of complete formulas of almost prime models | 2020-02-28 | Paper |
| Computability-theoretic categoricity and Scott families | 2019-04-30 | Paper |
| Orders on magmas and computability theory | 2018-08-10 | Paper |
| Generically Computable Equivalence Structures and Isomorphisms | 2018-08-08 | Paper |
| The Lattice of Computably Enumerable Vector Spaces | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3179080 | 2016-12-20 | Paper |
| Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra | 2016-08-17 | Paper |
| Orbits of maximal vector spaces | 2016-05-12 | Paper |
| Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations | 2016-01-13 | Paper |
| Computability-theoretic properties of injection structures | 2015-05-11 | Paper |
| Isomorphisms of Non-Standard Fields and Ash’s Conjecture | 2015-02-25 | Paper |
| Turing Degrees of Isomorphism Types of Geometric Objects | 2015-02-24 | Paper |
| Two-to-one structures | 2014-04-01 | Paper |
| Describing free groups | 2013-08-19 | Paper |
| The computable embedding problem | 2012-12-17 | Paper |
| Spectra of high\(_n\) and non-low\(_n\) degrees | 2012-09-05 | Paper |
| Isomorphism relations on computable structures | 2012-04-19 | Paper |
| \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures | 2011-09-22 | Paper |
| Effective Categoricity of Injection Structures | 2011-09-09 | Paper |
| Spaces of orders and their Turing degree spectra | 2011-08-26 | Paper |
| Computability of Fraïssé limits | 2011-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3068266 | 2011-01-13 | Paper |
| Simple structures with complex symmetry | 2010-09-25 | Paper |
| $\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures | 2010-07-28 | Paper |
| Intrinsic bounds on complexity and definability at limit levels | 2009-09-29 | Paper |
| Effective categoricity of abelian \(p\)-groups | 2009-06-10 | Paper |
| Chains and antichains in partial orderings | 2009-03-17 | Paper |
| Partial automorphism semigroups | 2009-01-28 | Paper |
| Index sets of computable structures | 2008-12-18 | Paper |
| Introduction to the philosophy and mathematics of algorithmic learning theory | 2008-04-29 | Paper |
| Inductive inference systems for learning classes of algorithmically generated sets and structures | 2008-04-29 | Paper |
| Π10 classes and strong degree spectra of relations | 2007-10-17 | Paper |
| Turing degrees of nonabelian groups | 2007-07-27 | Paper |
| Relatively Hyperimmune Relations on Structures | 2007-07-26 | Paper |
| Turing degrees of isomorphism types of algebraic objects | 2007-07-23 | Paper |
| COMPACTNESS OF THE SPACE OF LEFT ORDERS | 2007-05-21 | Paper |
| Spectra of structures and relations | 2007-03-12 | Paper |
| Bounding homogenous models | 2007-03-12 | Paper |
| On the learnability of vector spaces | 2007-01-22 | Paper |
| Effective categoricity of equivalence structures | 2006-08-16 | Paper |
| Enumerations in computable structure theory | 2005-10-26 | Paper |
| Π11 relations and paths through | 2005-08-29 | Paper |
| Dependence relations in computably rigid computable vector spaces | 2005-01-11 | Paper |
| Computability-Theoretic Complexity of Countable Structures | 2003-10-27 | Paper |
| Simple and immune relations on countable structures | 2003-09-16 | Paper |
| Trivial, strongly minimal theories are model complete after naming constants | 2003-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420753 | 2003-08-18 | Paper |
| Turing degrees of hypersimple relations on computable structures | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4806076 | 2003-05-05 | Paper |
| Sequences of n-diagrams | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249356 | 2001-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946097 | 2000-03-22 | Paper |
| Turing degrees of certain isomorphic images of computable relations | 1999-06-24 | Paper |
| Effectively and Noneffectively Nowhere Simple Sets | 1996-11-04 | Paper |
| The possible Turing degree of the nonzero member in a two element degree spectrum | 1993-05-16 | Paper |
| Some effects of Ash-Nerode and other decidability conditions on degree spectra | 1992-06-28 | Paper |
| Uncountable degree spectra | 1992-06-28 | Paper |
| REGULAR RELATIONS AND THE QUANTIFIER “THERE EXIST UNCOUNTABLY MANY” | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3955415 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949430 | 1981-01-01 | Paper |
| In Memory of Martin Davis | N/A | Paper |
| Generically Computable Linear Orderings | N/A | Paper |
