| Publication | Date of Publication | Type |
|---|
| Classes of algebraic structures | 2024-02-01 | Paper |
| EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER | 2023-09-11 | Paper |
| Free structures and limiting density | 2022-09-08 | Paper |
| COPYING ONE OF A PAIR OF STRUCTURES | 2022-08-29 | Paper |
| INTERPRETING A FIELD IN ITS HEISENBERG GROUP | 2022-08-29 | Paper |
| Lengths of roots of polynomials in a Hahn field | 2021-11-16 | Paper |
| CODING IN GRAPHS AND LINEAR ORDERINGS | 2021-01-29 | Paper |
| Complexity of Scott sentences | 2021-01-25 | Paper |
| Well Quasi-orderings and Roots of Polynomials in a Hahn Field | 2020-07-08 | Paper |
| Interpreting a field in its Heisenberg group | 2020-06-21 | Paper |
| Lengths of developments in \(K((G))\) | 2019-02-15 | Paper |
| Hanf number for Scott sentences of computable structures | 2019-01-14 | Paper |
| UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES | 2018-08-10 | Paper |
| Strongly minimal theories with recursive models | 2018-06-21 | Paper |
| Some new computable structures of high rank | 2018-04-20 | Paper |
| Scott sentences for certain groups | 2018-04-17 | Paper |
| COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS | 2017-06-01 | Paper |
| COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS | 2017-04-28 | Paper |
| COMPARING TWO VERSIONS OF THE REALS | 2017-04-28 | Paper |
| Scott sentences for certain groups | 2016-06-20 | Paper |
| Comparing classes of finite sums | 2016-05-12 | Paper |
| Hanf Number for Scott Sentences of Computable Structures | 2016-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3464657 | 2016-01-27 | Paper |
| Preserving categoricity and complexity of relations | 2015-10-27 | Paper |
| Representing Scott sets in algebraic settings | 2015-09-01 | Paper |
| Erratum to: ``Limit computable integer parts | 2015-04-14 | Paper |
| Using computability to measure complexity of algebraic structures and classes of structures | 2015-03-17 | Paper |
| Index sets and Scott sentences | 2014-08-29 | Paper |
| The Arithmetical Hierarchy in the Setting of $\omega_1$ | 2014-04-30 | Paper |
| Spectra of Atomic Theories | 2014-04-04 | Paper |
| Classes of structures with universe a subset of 1 | 2014-04-01 | Paper |
| Describing free groups | 2013-08-19 | Paper |
| Complexity of structures associated with real closed fields | 2013-08-05 | Paper |
| An example related to Gregory's theorem | 2013-06-28 | Paper |
| The computable embedding problem | 2012-12-17 | Paper |
| Real closed exponential fields | 2012-10-31 | Paper |
| Corrigendum to: ``Real closed fields and models of arithmetic | 2012-06-19 | Paper |
| Isomorphism relations on computable structures | 2012-04-19 | Paper |
| Limit computable integer parts | 2011-11-23 | Paper |
| COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ | 2011-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093863 | 2011-10-19 | Paper |
| Classes of Ulm type and coding rank-homogeneous trees in other structures | 2011-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3068266 | 2011-01-13 | Paper |
| Decidability and computability of certain torsion-free abelian groups | 2010-06-11 | Paper |
| Real closed fields and models of Peano arithmetic | 2010-03-15 | Paper |
| Intrinsic bounds on complexity and definability at limit levels | 2009-09-29 | Paper |
| Categoricity of computable infinitary theories | 2009-03-17 | Paper |
| Chains and antichains in partial orderings | 2009-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549468 | 2008-12-28 | Paper |
| Index sets of computable structures | 2008-12-18 | Paper |
| Structures in Familiar Classes Which Have Scott Rank $\omega_1^{CK}$ | 2008-03-22 | Paper |
| Index sets for classes of high rank structures | 2008-02-25 | Paper |
| Computable embeddings and strongly minimal theories | 2007-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5295697 | 2007-07-30 | Paper |
| Relatively Hyperimmune Relations on Structures | 2007-07-26 | Paper |
| Strong initial segments of models of IΔ0 | 2007-07-26 | Paper |
| Classification from a Computable Viewpoint | 2007-04-05 | Paper |
| Comparing Classes of Finite Structures | 2006-07-18 | Paper |
| Computable trees of Scott rank ω1CK, and computable approximation | 2006-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5711890 | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702667 | 2005-11-02 | Paper |
| Enumerations in computable structure theory | 2005-10-26 | Paper |
| Bounding prime models | 2005-08-29 | Paper |
| Π11 relations and paths through | 2005-08-29 | Paper |
| Barwise: Infinitary Logic and Admissible Sets | 2005-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4656799 | 2005-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4451633 | 2004-02-29 | Paper |
| Simple and immune relations on countable structures | 2003-09-16 | Paper |
| Minimality and completions of PA | 2002-07-14 | Paper |
| Sequences of n-diagrams | 2002-01-01 | Paper |
| Computable Boolean algebras | 2001-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4513971 | 2001-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938559 | 2000-08-15 | Paper |
| Computable structures and the hyperarithmetical hierarchy | 2000-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249362 | 2000-03-29 | Paper |
| Coding a family of sets | 1999-11-08 | Paper |
| Possible degrees in recursive copies. II | 1997-12-08 | Paper |
| Quasi-simple relations in copies of a given recursive structure | 1997-10-14 | Paper |
| Permitting, forcing, and copying of a given recursive relation | 1997-10-14 | Paper |
| Recursive Structures and Ershov's Hierarchy | 1997-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689739 | 1997-01-07 | Paper |
| Possible degrees in recursive copies | 1996-05-13 | Paper |
| In Memoriam: Christopher John Ash | 1995-09-20 | Paper |
| Ramified systems | 1995-08-27 | Paper |
| Mixed systems | 1995-08-27 | Paper |
| Requirement systems | 1995-07-03 | Paper |
| A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas | 1995-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314795 | 1995-04-03 | Paper |
| Relatively recursive expansions | 1995-03-29 | Paper |
| Nonarithmetical ℵ0-categorical theories with recursive models | 1995-01-22 | Paper |
| Recursive expansions | 1994-11-10 | Paper |
| Orderings with αth Jump Degree 0 (α) | 1992-06-28 | Paper |
| Jumps of Orderings | 1990-01-01 | Paper |
| Pairs of recursive structures | 1990-01-01 | Paper |
| A metatheorem for constructions by finitely many workers | 1990-01-01 | Paper |
| Constructions by transfinitely many workers | 1990-01-01 | Paper |
| Decidability for a temporal logic used in discrete-event system analysis | 1990-01-01 | Paper |
| Generic copies of countable structures | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3032236 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773855 | 1987-01-01 | Paper |
| Definable Sets in Ordered Structures. II | 1986-01-01 | Paper |
| Degrees coded in jumps of orderings | 1986-01-01 | Paper |
| Saturation of homogeneous resplendent models | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3762299 | 1986-01-01 | Paper |
| Two theorems on degrees of models of true arithmetic | 1984-01-01 | Paper |
| Degrees of types and independent sequences | 1983-01-01 | Paper |
| A complete theory with arbitrarily large minimality ranks | 1983-01-01 | Paper |
| Additive structure in uncountable models for a fixed completion of P | 1983-01-01 | Paper |
| Expansions of models and turing degrees | 1982-01-01 | Paper |
| Models of arithmetic and closed ideals | 1982-01-01 | Paper |
| Theories whose resplendent models are homogeneous | 1982-01-01 | Paper |
| Algebraic independence | 1981-01-01 | Paper |
| An inelastic model with indiscernibles | 1978-01-01 | Paper |
| Prime and atomic models | 1978-01-01 | Paper |
| Skolem functions and elementary embeddings | 1977-01-01 | Paper |
| A complete Lω1ω-sentence characterizing ℵ1 | 1977-01-01 | Paper |
| Hanf numbers for omitting types over particular theories | 1976-01-01 | Paper |
| Omitting types in set theory and arithmetic | 1976-01-01 | Paper |
| Types omitted in uncountable models of arithmetic | 1975-01-01 | Paper |
| Generic expansions of structures | 1974-01-01 | Paper |
| Complete types and the natural numbers | 1973-01-01 | Paper |
| Torsion-free abelian groups of finite rank and fields of finite transcendence degree | N/A | Paper |
