We prove that ifM is any model of a trivial, strongly minimal theory, then the elementary diagram Th(MM ) is a model complete LM -theory. We conclude that all countable models of a trivial, stronglyâ€¦ (More)

Let G be a computable ordered abelian group. We show that the computable dimension of G is either 1 or Ï‰, that G is computably categorical if and only if it has finite rank, and that if G has onlyâ€¦ (More)

When bounds on complexity of some aspect of a structure are preserved under isomorphism, we refer to them as intrinsic. Here, building on work of Soskov [33], [34], we give syntactical conditionsâ€¦ (More)

Monads are used in functional programming as a means of modeling and encapsulating computational effects at an appropriate level of abstraction. In previous work, we have introduced monad-basedâ€¦ (More)

We show that every computable relation on a computable Boolean algebra B is either definable by a quantifier-free formula with constants from B (in which case it is obviously intrinsicallyâ€¦ (More)

The theory of computable numberings is one of the main parts of the theory of numberings. The papers of H. Rogers [36] and R. Friedberg [21] are the starting points in the systematical investigationâ€¦ (More)