Computable model theory investigates the algorithmic aspects of model theoretic structures, aiming to delineate the boundaries between the computable and non-computable within various algebraic and ...

The theory of abelian totally ordered groups has a model completion. We show that the theory of abelian lattice-ordered groups has no model companion. Indeed, the Archimedean property can be captured ...

We study the Fourier characterisation of strictly positive definite functions on compact abelian groups. Our main result settles the case G = F × T r , with r ∈ N and where F is a finite abelian group ...