Paires élémentaires de corps pseudo-Finis: Dénombrement Des complétions (elementary pairs of pseudo-finite fields: Counting completions)

Journal of Symbolic Logic 65 (2):705-718 (2000)
  Copy   BIBTEX

Abstract

Soit Π une théorie complète de corps pseudo-finis. L'objet de cet article est de montrer que, dans le langage des anneaux augmenté d'un symbole de prédicat unaire (pour le petit corps), la théorie des paires élémentaires non triviales de modèles de Π admet 2n0 complétions, soit le maximum envisageable. /// Let Π be a complete theorie 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 2 ℵ 0 completions, that is, the maximum that could exist

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,707

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
Élimination Des quantificateurs dans Des paires de corps.G. Leloup - 1995 - Journal of Symbolic Logic 60 (2):548-562.
Varieties of pseudo-interior algebras.Barbara Klunder - 2000 - Studia Logica 65 (1):113-136.
T-convexity and Tame extensions.LouDen Dries & Adam H. Lewenberg - 1995 - Journal of Symbolic Logic 60 (1):74 - 102.
Sur la théorie élémentaire Des corps de fonctions.Jean-Louis Duret - 1986 - Journal of Symbolic Logic 51 (4):948-956.

Analytics

Added to PP
2009-01-28

Downloads
91 (#191,201)

6 months
14 (#199,798)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generic pairs of SU-rank 1 structures.Evgueni Vassiliev - 2003 - Annals of Pure and Applied Logic 120 (1-3):103-149.

Add more citations

References found in this work

No references found.

Add more references