Saturated structures are structures in which all possible types are realized (roughly speaking; see below for an exact formulation). In this chapter we prove their existence and uniqueness and show how they can be used in logical investigations.
KeywordsFinite Subset Countable Model Relation Symbol Operation Symbol Individual Constant
Unable to display preview. Download preview PDF.