Article contents
Paires élémentaires de corps pseudo-finis: dénombrement des complétions (Elementary pairs of pseudo-finite fields: counting completions)
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2000
References
REFERENCES
- 1
- Cited by