| Publication | Date of Publication | Type |
|---|
Classes of algebraic structures
Journal of Mathematical Sciences (New York) | 2024-02-01 | Paper |
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
Journal of Symbolic Logic | 2023-09-11 | Paper |
| Free structures and limiting density | 2022-09-08 | Paper |
COPYING ONE OF A PAIR OF STRUCTURES
Journal of Symbolic Logic | 2022-08-29 | Paper |
INTERPRETING A FIELD IN ITS HEISENBERG GROUP
Journal of Symbolic Logic | 2022-08-29 | Paper |
Lengths of roots of polynomials in a Hahn field
Algebra and Logic | 2021-11-16 | Paper |
CODING IN GRAPHS AND LINEAR ORDERINGS
Journal of Symbolic Logic | 2021-01-29 | Paper |
Complexity of Scott sentences
Fundamenta Mathematicae | 2021-01-25 | Paper |
Well quasi-orderings and roots of polynomials in a Hahn field
Trends in Logic | 2020-07-08 | Paper |
Interpreting a field in its Heisenberg group
(available as arXiv preprint) | 2020-06-21 | Paper |
Lengths of developments in \(K((G))\)
Selecta Mathematica. New Series | 2019-02-15 | Paper |
Hanf number for Scott sentences of computable structures
Archive for Mathematical Logic | 2019-01-14 | Paper |
Uniform procedures in uncountable structures
Journal of Symbolic Logic | 2018-08-10 | Paper |
Strongly minimal theories with recursive models
Journal of the European Mathematical Society (JEMS) | 2018-06-21 | Paper |
Some new computable structures of high rank
Proceedings of the American Mathematical Society | 2018-04-20 | Paper |
Scott sentences for certain groups
Archive for Mathematical Logic | 2018-04-17 | Paper |
Computing strength of structures related to the field of real numbers
Journal of Symbolic Logic | 2017-06-01 | Paper |
Computable structures in generic extensions
Journal of Symbolic Logic | 2017-04-28 | Paper |
Comparing two versions of the reals
Journal of Symbolic Logic | 2017-04-28 | Paper |
Scott sentences for certain groups
(available as arXiv preprint) | 2016-06-20 | Paper |
Comparing classes of finite sums
Algebra and Logic | 2016-05-12 | Paper |
Hanf Number for Scott Sentences of Computable Structures
(available as arXiv preprint) | 2016-02-02 | Paper |
| scientific article; zbMATH DE number 6536307 (Why is no real title available?) | 2016-01-27 | Paper |
Preserving categoricity and complexity of relations
Algebra and Logic | 2015-10-27 | Paper |
Representing Scott sets in algebraic settings
Archive for Mathematical Logic | 2015-09-01 | Paper |
Erratum to: ``Limit computable integer parts
Archive for Mathematical Logic | 2015-04-14 | Paper |
Using computability to measure complexity of algebraic structures and classes of structures
Lobachevskii Journal of Mathematics | 2015-03-17 | Paper |
Index sets and Scott sentences
Archive for Mathematical Logic | 2014-08-29 | Paper |
| The arithmetical hierarchy in the setting of \(\omega_1\) | 2014-04-30 | Paper |
Spectra of atomic theories
Journal of Symbolic Logic | 2014-04-04 | Paper |
Spectra of atomic theories
Journal of Symbolic Logic | 2014-04-04 | Paper |
Classes of structures with universe a subset of \(\omega _{1}\)
Journal Of Logic And Computation | 2014-04-01 | Paper |
Describing free groups
Transactions of the American Mathematical Society | 2013-08-19 | Paper |
Complexity of structures associated with real closed fields
Proceedings of the London Mathematical Society | 2013-08-05 | Paper |
An example related to Gregory's theorem
Archive for Mathematical Logic | 2013-06-28 | Paper |
The computable embedding problem
Algebra and Logic | 2012-12-17 | Paper |
Real closed exponential fields
Fundamenta Mathematicae | 2012-10-31 | Paper |
Corrigendum to: ``Real closed fields and models of arithmetic
The Journal of Symbolic Logic | 2012-06-19 | Paper |
Isomorphism relations on computable structures
Journal of Symbolic Logic | 2012-04-19 | Paper |
Isomorphism relations on computable structures
Journal of Symbolic Logic | 2012-04-19 | Paper |
Limit computable integer parts
Archive for Mathematical Logic | 2011-11-23 | Paper |
Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
Journal of Mathematical Logic | 2011-10-24 | Paper |
| scientific article; zbMATH DE number 5960302 (Why is no real title available?) | 2011-10-19 | Paper |
Classes of Ulm type and coding rank-homogeneous trees in other structures
Journal of Symbolic Logic | 2011-10-10 | Paper |
| On automorphic tuples of elements in computable models | 2011-01-13 | Paper |
Decidability and computability of certain torsion-free abelian groups
Notre Dame Journal of Formal Logic | 2010-06-11 | Paper |
Real closed fields and models of Peano arithmetic
Journal of Symbolic Logic | 2010-03-15 | Paper |
Intrinsic bounds on complexity and definability at limit levels
Journal of Symbolic Logic | 2009-09-29 | Paper |
Categoricity of computable infinitary theories
Archive for Mathematical Logic | 2009-03-17 | Paper |
Chains and antichains in partial orderings
Archive for Mathematical Logic | 2009-03-17 | Paper |
| scientific article; zbMATH DE number 5485222 (Why is no real title available?) | 2008-12-28 | Paper |
Index sets of computable structures
Algebra and Logic | 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
Journal of Symbolic Logic | 2008-02-25 | Paper |
Computable embeddings and strongly minimal theories
Journal of Symbolic Logic | 2007-10-17 | Paper |
| Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes | 2007-07-30 | Paper |
Relatively Hyperimmune Relations on Structures
Algebra and Logic | 2007-07-26 | Paper |
Strong initial segments of models of IΔ0
Fundamenta Mathematicae | 2007-07-26 | Paper |
Classification from a Computable Viewpoint
The Bulletin of Symbolic Logic | 2007-04-05 | Paper |
Comparing Classes of Finite Structures
Algebra and Logic | 2006-07-18 | Paper |
Computable trees of Scott rank ω1CK, and computable approximation
Journal of Symbolic Logic | 2006-07-05 | Paper |
| scientific article; zbMATH DE number 2236639 (Why is no real title available?) | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 2222018 (Why is no real title available?) | 2005-11-02 | Paper |
Enumerations in computable structure theory
Annals of Pure and Applied Logic | 2005-10-26 | Paper |
Bounding prime models
Journal of Symbolic Logic | 2005-08-29 | Paper |
Π11 relations and paths through
Journal of Symbolic Logic | 2005-08-29 | Paper |
Barwise: Infinitary Logic and Admissible Sets
The Bulletin of Symbolic Logic | 2005-05-24 | Paper |
| scientific article; zbMATH DE number 2144526 (Why is no real title available?) | 2005-03-14 | Paper |
| scientific article; zbMATH DE number 2047478 (Why is no real title available?) | 2004-02-29 | Paper |
Simple and immune relations on countable structures
Archive for Mathematical Logic | 2003-09-16 | Paper |
Minimality and completions of PA
The Journal of Symbolic Logic | 2002-07-14 | Paper |
Sequences of n-diagrams
Journal of Symbolic Logic | 2002-01-01 | Paper |
Computable Boolean algebras
The Journal of Symbolic Logic | 2001-07-16 | Paper |
| scientific article; zbMATH DE number 1531928 (Why is no real title available?) | 2001-06-18 | Paper |
| scientific article; zbMATH DE number 1405580 (Why is no real title available?) | 2000-08-15 | Paper |
Computable structures and the hyperarithmetical hierarchy
Studies in Logic and the Foundations of Mathematics | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1302876 (Why is no real title available?) | 2000-03-29 | Paper |
Coding a family of sets
Annals of Pure and Applied Logic | 1999-11-08 | Paper |
Possible degrees in recursive copies. II
Annals of Pure and Applied Logic | 1997-12-08 | Paper |
Quasi-simple relations in copies of a given recursive structure
Annals of Pure and Applied Logic | 1997-10-14 | Paper |
Permitting, forcing, and copying of a given recursive relation
Annals of Pure and Applied Logic | 1997-10-14 | Paper |
Recursive Structures and Ershov's Hierarchy
Mathematical Logic Quarterly | 1997-05-27 | Paper |
| scientific article; zbMATH DE number 961793 (Why is no real title available?) | 1997-01-07 | Paper |
Possible degrees in recursive copies
Annals of Pure and Applied Logic | 1996-05-13 | Paper |
In Memoriam: Christopher John Ash
The Bulletin of Symbolic Logic | 1995-09-20 | Paper |
Ramified systems
Annals of Pure and Applied Logic | 1995-08-27 | Paper |
Mixed systems
Journal of Symbolic Logic | 1995-08-27 | Paper |
Requirement systems
Journal of Symbolic Logic | 1995-07-03 | Paper |
A Completeness Theorem for Certain Classes of Recursive Infinitary Formulas
Mathematical Logic Quarterly | 1995-04-20 | Paper |
| scientific article; zbMATH DE number 695580 (Why is no real title available?) | 1995-04-03 | Paper |
Relatively recursive expansions
Fundamenta Mathematicae | 1995-03-29 | Paper |
Relatively recursive expansions
Fundamenta Mathematicae | 1995-03-29 | Paper |
Nonarithmetical ℵ0-categorical theories with recursive models
Journal of Symbolic Logic | 1995-01-22 | Paper |
Recursive expansions
Fundamenta Mathematicae | 1994-11-10 | Paper |
Orderings with αth Jump Degree 0 (α)
Proceedings of the American Mathematical Society | 1992-06-28 | Paper |
| Jumps of Orderings | 1990-01-01 | Paper |
Pairs of recursive structures
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
A metatheorem for constructions by finitely many workers
Journal of Symbolic Logic | 1990-01-01 | Paper |
Constructions by transfinitely many workers
Annals of Pure and Applied Logic | 1990-01-01 | Paper |
Decidability for a temporal logic used in discrete-event system analysis
International Journal of Control | 1990-01-01 | Paper |
Generic copies of countable structures
Annals of Pure and Applied Logic | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4033714 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4130358 (Why is no real title available?) | 1987-01-01 | Paper |
Saturation of homogeneous resplendent models
Journal of Symbolic Logic | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4012589 (Why is no real title available?) | 1986-01-01 | Paper |
| Definable Sets in Ordered Structures. II | 1986-01-01 | Paper |
Degrees coded in jumps of orderings
Journal of Symbolic Logic | 1986-01-01 | Paper |
Two theorems on degrees of models of true arithmetic
Journal of Symbolic Logic | 1984-01-01 | Paper |
Degrees of types and independent sequences
Journal of Symbolic Logic | 1983-01-01 | Paper |
A complete theory with arbitrarily large minimality ranks
Journal of Symbolic Logic | 1983-01-01 | Paper |
Additive structure in uncountable models for a fixed completion of P
Journal of Symbolic Logic | 1983-01-01 | Paper |
Expansions of models and turing degrees
Journal of Symbolic Logic | 1982-01-01 | Paper |
Models of arithmetic and closed ideals
Journal of Symbolic Logic | 1982-01-01 | Paper |
Theories whose resplendent models are homogeneous
Israel Journal of Mathematics | 1982-01-01 | Paper |
Algebraic independence
Journal of Symbolic Logic | 1981-01-01 | Paper |
An inelastic model with indiscernibles
Journal of Symbolic Logic | 1978-01-01 | Paper |
Prime and atomic models
Journal of Symbolic Logic | 1978-01-01 | Paper |
Skolem functions and elementary embeddings
Journal of Symbolic Logic | 1977-01-01 | Paper |
A complete Lω1ω-sentence characterizing ℵ1
Journal of Symbolic Logic | 1977-01-01 | Paper |
Hanf numbers for omitting types over particular theories
Journal of Symbolic Logic | 1976-01-01 | Paper |
Omitting types in set theory and arithmetic
Journal of Symbolic Logic | 1976-01-01 | Paper |
Types omitted in uncountable models of arithmetic
Journal of Symbolic Logic | 1975-01-01 | Paper |
Generic expansions of structures
Journal of Symbolic Logic | 1974-01-01 | Paper |
Complete types and the natural numbers
Journal of Symbolic Logic | 1973-01-01 | Paper |
Torsion-free abelian groups of finite rank and fields of finite transcendence degree
(available as arXiv preprint) | N/A | Paper |
