Abstract
Two elements a and b in L-structures (structures whose similarity type is that of L) are said to have the same type if they satisfy the same formulas f(x) in L; the type of a is the set p a of formulas f(x) that a satisfies. What is a type but a complete theory in the language L(x) obtained by adding to L a constant symbol x? For reasons of convenience, we write this constant symbol here as a variable.
Le méchant gout du siècle en cela me fait peur; Nos pères, tous grossiers, l’avaient beaucoup meilleur Et je prise bien moins out ce que l’on admire Qu’une vieille chanson que je m’en vais vous dire: La rime n’est pas riche et le style en est vieux: Mais ne voyez-vous pas que cela vaut bien mieux Que ces colfichets...
J. B. P.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Poizat, B. (2000). The Back-and-Forth Method in ω-Saturated Models. In: A Course in Model Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8622-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8622-1_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6446-0
Online ISBN: 978-1-4419-8622-1
eBook Packages: Springer Book Archive