Elementary pairs of pseudo-finite fields: Counting completions

Authors
Lejeune, H
Citation
H. Lejeune, Elementary pairs of pseudo-finite fields: Counting completions, J SYMB LOG, 65(2), 2000, pp. 705-718
Citations number
5
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF SYMBOLIC LOGIC
ISSN journal
00224812 → ACNP
Volume
65
Issue
2
Year of publication
2000
Pages
705 - 718
Database
ISI
SICI code
0022-4812(200006)65:2<705:EPOPFC>2.0.ZU;2-W
Abstract
Let fi he a complete theorie of pseudo-finite fields. In this article we pr ove 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 Pi ha s 2(aleph 0) completions, that is, the maximum that could exist.