ConceptComplete

Structures and Languages

Model theory studies the relationship between formal languages and their interpretations (models). The fundamental objects are first-order structures, which provide concrete semantics for abstract syntactic theories.


First-Order Languages

Definition4.1First-Order Language

A first-order language L\mathcal{L} consists of:

  • A set of constant symbols {ci}\{c_i\}
  • A set of function symbols {fj}\{f_j\}, each with specified arity
  • A set of relation symbols {Rk}\{R_k\}, each with specified arity
  • Logical connectives ¬,,,,\neg, \land, \lor, \to, \leftrightarrow, quantifiers ,\forall, \exists, variables, and the equality symbol ==
Definition4.2$\mathcal{L}$-Structure

An L\mathcal{L}-structure M\mathcal{M} consists of a non-empty set MM (the domain or universe), together with:

  • An element ciMMc_i^{\mathcal{M}} \in M for each constant symbol cic_i
  • A function fjM:MnjMf_j^{\mathcal{M}}: M^{n_j} \to M for each njn_j-ary function symbol fjf_j
  • A subset RkMMmkR_k^{\mathcal{M}} \subseteq M^{m_k} for each mkm_k-ary relation symbol RkR_k
ExampleGroups as Structures

A group can be viewed as an Lgrp\mathcal{L}_{\text{grp}}-structure where Lgrp={e,,1}\mathcal{L}_{\text{grp}} = \{e, \cdot, ^{-1}\} with ee a constant, \cdot a binary function, and 1^{-1} a unary function. The group axioms are first-order sentences in this language.


Satisfaction and Models

Definition4.3Satisfaction Relation

For an L\mathcal{L}-structure M\mathcal{M} and a sentence σ\sigma in L\mathcal{L}, the satisfaction relation Mσ\mathcal{M} \models \sigma (read "M\mathcal{M} models σ\sigma" or "σ\sigma is true in M\mathcal{M}") is defined inductively on the complexity of σ\sigma. A structure M\mathcal{M} is a model of a theory TT if Mσ\mathcal{M} \models \sigma for all σT\sigma \in T.

RemarkSemantic vs. Syntactic

Model theory mediates between the syntactic (provability, TσT \vdash \sigma) and the semantic (truth in models, Mσ\mathcal{M} \models \sigma). The completeness theorem of Gödel bridges these: TσT \vdash \sigma if and only if every model of TT satisfies σ\sigma.