1983
DOI: 10.2307/2273543
|View full text |Cite
|
Sign up to set email alerts
|

Paires de structures stables

Abstract: Le paradigme de théorie stable est la théorie T d'un corps algébriquement clos; une autre théorie stable T′ est celle de la structure formée d'un corps algébriquement clos, avec en outre un symbole relationnel unaire interprétant un de ses sous-corps propres algébriquement clos. C'est à l'éclaircissement des rapports de T et de T′ qu'est consacré cet article.J'y considère une théorie complète T stable, et les structures formées d'un modèle N de T, avec en outre un symbole relationnel unaire (x) interprétant un… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

4
67
0
5

Year Published

2004
2004
2017
2017

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 63 publications
(76 citation statements)
references
References 2 publications
4
67
0
5
Order By: Relevance
“…Assume that T is complete, and consider the language L P = L ∪ {P }. Then every two |T | + -lovely pairs are elementarily equivalent in this language, and any two free sets of cardinality ≤ |T | with the same L P -diagram have the same type (this generalises results in [Poi83,BPV03]). Indeed, since two such sets have the same P-type, they correspond by an infinite backand-forth in saturated structures.…”
Section: Lovely Pairssupporting
confidence: 57%
See 1 more Smart Citation
“…Assume that T is complete, and consider the language L P = L ∪ {P }. Then every two |T | + -lovely pairs are elementarily equivalent in this language, and any two free sets of cardinality ≤ |T | with the same L P -diagram have the same type (this generalises results in [Poi83,BPV03]). Indeed, since two such sets have the same P-type, they correspond by an infinite backand-forth in saturated structures.…”
Section: Lovely Pairssupporting
confidence: 57%
“…The following is proved in [BPV03] (the analogue for beautiful pairs of models of a stable theory is proved in [Poi83]):…”
Section: Introductionmentioning
confidence: 99%
“…This situation has been studied extensively, typically in the case where A is an elementary submodel of M [20], [3], [24] or in the context of stable theories, when the induced structure on the predicate is stable [7], [2].…”
Section: Introductionmentioning
confidence: 99%
“…The proof we give of Theorem 3.3 uses Poizat's technology of belles paires from [8] and we begin by briefly recalling this.…”
Section: 2mentioning
confidence: 99%
“…Let T P G denote the L P -theory of all belles paires. As T G is stable, T P G is complete ( [8], Théorème 4) and T G has nfcp iff every ω + -saturated (in the L P -sense) model of T P G is a belle paire ( [8], Théorème 6).…”
Section: 2mentioning
confidence: 99%