Completeness of two theories on ordered abelian groups and embedding relations

Abstract

The first order language ℒ that we consider has two nullary function symbols 0, 1, a unary function symbol –, a binary function symbol +, a unary relation symbol 0 <, and the binary relation symbol = (equality). Let ℒ′ be the language obtained from ℒ, by adding, for each integer n > 0, the unary relation symbol n| (read “n divides”).