go-v.orgcodex
Menu
Page tools

codex · Philosophy

Type (model theory)

In model theory and related areas of mathematics, a type is an object that describes how a (real or possible) element or finite collection of 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 that are true of a set of n-tuples 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 (tuples of) elements of ℳ leads to the ideas of saturated models and omitting types.

Wikipedia contributors, "Type (model theory)", Wikipedia, revision 1372879327, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex