Model-completion of scaled lattices
Luck Darnière
Abstract
It is known from Grzegorczyk's paper grze-1951 that the lattice of real semi-algebraic closed subsets of Rn is undecidable for every integer n≥ 2. More generally, if X is any definable set over a real or algebraically closed field K, then the lattice L(X) of all definable subsets of X closed in X is undecidable whenever X≥ 2. Nevertheless, we investigate in this paper the model theory of the class SC\def(K,d) of all such lattices L(X) with X≤ d and K as above or a henselian valued field of characteristic zero. <p> We show that the universal theory of SC\def(K,d), in a natural expansion by definition of the lattice language, is the same for every such field K. 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 L( Q\pd) to be a model of (a little variant of) this model-completion. This leads us to a new conjecture in p-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 L( R\pd), uniformly in p.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf