Model-completion of scaled lattices
Abstract
It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of is undecidable for every integer . More generally, if is any definable set over a real or algebraically closed field , then the lattice of all definable subsets of closed in is undecidable whenever . Nevertheless, we investigate in this paper the model theory of the class of all such lattices with and as above or a henselian valued field of characteristic zero. <p> We show that the universal theory of , in a natural expansion by definition of the lattice language, is the same for every such field . We give a finite axiomatization of it and prove that it is locally finite and admits a model-completion, which turns to be decidable as well as all its completions. We expect to be a model of (a little variant of) this model-completion. This leads us to a new conjecture in -adic semi-algebraic geometry which, combined with the results of this paper, would give decidability (via a natural recursive axiomatization) and elimination of quantifiers for the complete theory of , uniformly in .
Cite
@article{arxiv.math/0606792,
title = {Model-completion of scaled lattices},
author = {Luck Darnière},
journal= {arXiv preprint arXiv:math/0606792},
year = {2016}
}
Comments
27 pages