Open AccessMathematics

R. Cluckers, Immanuel Halupczok

2011.10.14Confluentes Mathematici

DOI: 10.1142/s1793744211000473

tlooto Summary

A new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language is given and it is found that all definable functions in ordered abelsian groups are piecewise linear on finitely many definable pieces.

Abstract

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in the group is a union of a family of quantifier free definable sets, where the parameter of the family runs over a set definable (with quantifiers) in a sort which carries the structure of an ordered set with some additional unary predicates. As a corollary, we find that all definable functions in ordered abelian groups are piecewise linear on finitely many definable pieces.

Citation format

CLUCKERS, R.; HALUPCZOK, Immanuel. Quantifier elimination in ordered abelian groups [preprint]. arXiv, 2011. arXiv:1110.3200.