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.
SATURABILITÉ sf. T. de chimie. Qualité de ce qui est saturable.
SATURABLE adj. Qui es susceptible de saturation.
SATURANT, ANTE adj. Qui a la propriété de saturer.
SATURATION (sa-tu-ra-sion) sf. T. de chimie
(1) Le terme où, les affinités reciproques des deux principes d’un corps binaire etant satisfaites, aucun des deux principes n’est plus susceptible de s’unir avec une nouvelle quantite de l’autre...
(2) Saturation du sol des cimetieres, condition qui provient de ce que, des cadavres nouveaux y etant sans cesse inhumes, avant que les cadavres plus anciens aient eu le temps de se consumer, le sol devient impropre a operer les changements qui constituent la putrefaction.
E.L.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Saturated Models. In: A Course in Model Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8622-1_9
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8622-1_9
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