Paires élémentaires de corps pseudo-finis: dénombrement des complétions (Elementary pairs of pseudo-finite fields: counting completions)
Hélène Lejeune · Journal of Symbolic Logic · 2000
Abstract Let Π be a complete théorie of pseudo-finite fields. In this article we prove that, in the langage of fields to which we add a unary predicate for a substructure, the theory of non trivial elementary pairs of models of Π has completions, that is, the maximum that could exist.