Type (model theory) 型 (模型论)
(重定向自Omitting types theorem)
In model theory and related areas of mathematics, a type is an object that, loosely speaking, describes how a (real or possible) element or elements in a mathematical structure might behave. More precisely, it is a set of first-order formulas in a language L with free variables x1, x2,…, xn which are true of a sequence of elements of an L-structure
. Depending on the context, types can be complete or partial and they may use a fixed set of constants, A, from the structure
. The question of which types represent actual elements of
leads to the ideas of saturated models and omitting types.