The Back-and-Forth Method in ω-Saturated Models

  • Bruno Poizat
Part of the Universitext book series (UTX)


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.


Finite Subset Complete Theory Constant Symbol Elementary Extension Bibliographic Note 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  • Bruno Poizat
    • 1
  1. 1.Département des MathématiquesUniversite Claude Bernard Lyon IVilleurbanne CedexFrance

Personalised recommendations