Definition:Structure for Predicate Logic

Definition
Let $\mathcal L_1$ be the language of predicate logic.

A structure $\mathcal A$ for $\mathcal L_1$ comprises:


 * $(1):$ A non-empty set $A$;
 * $(2):$ For each function symbol $f$ of arity $n$, a mapping $f_{\mathcal A}: A^n \to A$;
 * $(3):$ For each predicate symbol $p$ of arity $n$, a mapping $p_{\mathcal A}: A^n \to \Bbb B$

where $\Bbb B$ denotes the set of truth values.

$A$ is called the underlying set of $\mathcal A$.

$f_{\mathcal A}$ and $p_{\mathcal A}$ are called the interpretations of $f$ and $p$ in $\mathcal A$, respectively.

We remark that function symbols of arity $0$ are interpreted as constants in $A$.

Also, the predicate symbols may be interpreted as relations via their characteristic functions.

Also known as
A structure for $\mathcal L_1$ is also often called a structure for predicate logic or first-order structure.

The latter formulation is particularly used when the precise vocabulary used for $\mathcal L_1$ is not important.

Also see

 * Definition:Language of Predicate Logic
 * Definition:Structure (Formal Systems)