Saturated Models

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

Abstract

We are now embarking on what can properly be called model theory. First, let us define some notation in general usage. Consider a theory T, in a language L, which shall be complete unless otherwise stated. We let |T| or |L| denote the cardinality of the language, that is to say, the number of formulas: It is equal to ω if L has finitely or denumerably many relation, function, and constant symbols; it is equal to κ if L has κ > ω of them. If T is complete and has a finite model M, that is its only model up to isomorphism; as this is not a very interesting case, we generally suppose that all the models of T are infinite.

Keywords

Saturated Model Constant Symbol Pure Type 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.

Preview

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