Math 2.0

Mathematical logic and foundations Definition

Type

Builds on TheoryWell-formed formulaModelSignature

Definition

Let LL be a signature, let TT be an LL-theory, and let n≥1n \ge 1. An nn-type of TT is a set p(x1,…,xn)p(x_1, \dots, x_n) of LL-formulas whose free variables are among x1,…,xnx_1, \dots, x_n, such that T∪pT \cup p is satisfiable. This means that some model MM of TT has a tuple (a1,…,an)(a_1, \dots, a_n) that satisfies every formula of pp. The type pp is complete if for every LL-formula φ(x1,…,xn)\varphi(x_1, \dots, x_n), either φ∈p\varphi \in p or ¬φ∈p\neg \varphi \in p. A model MM of TT realizes pp if some tuple of MM satisfies every formula of pp, and omits pp otherwise. The set of complete nn-types of TT is written Sn(T)S_n(T).

Let MM be a model and AA a set of elements of MM. Let LAL_A be LL extended by a new constant for each element of AA. A type over AA is a type of the LAL_A-theory of MM. The set of complete nn-types over AA is written SnM(A)S_n^M(A).

Remarks

For a tuple aˉ\bar{a} of a model MM, the set tp⁡(aˉ)\operatorname{tp}(\bar{a}) of all formulas satisfied by aˉ\bar{a} in MM is a complete type of the theory of MM.

Example: let TT be the theory of (ℕ,0,1,+,⋅,<)(\N, 0, 1, +, \cdot, <) and let p(x)={x>1+⋯+1 (k terms):k≥1}p(x) = \set{x > 1 + \cdots + 1 \ (k \text{ terms}) : k \ge 1}. Each finite part of pp is satisfied in ℕ\N by a large number, so by compactness T∪pT \cup p has a model, and pp is a 11-type. The standard model ℕ\N omits pp, while every nonstandard model of TT realizes it.

Non-example: in the theory of fields, {x=0,  x⋅x=1}\set{x = 0, \; x \cdot x = 1} is not a type, since x=0x = 0 gives x⋅x=0≠1x \cdot x = 0 \ne 1 in every field.

The set Sn(T)S_n(T) carries a natural topology, with basic open sets {p:φ∈p}\set{p : \varphi \in p}; it is a compact, totally disconnected Hausdorff space by the compactness theorem.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Model concept
  2. Signature concept
  3. Theory concept
  4. Well-formed formula concept
  5. Type definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Type_(model_theory)
About this page
TagVA7AK1R5AN
URIm2://VA7AK1R5AN
Kinddefinition
WritingW0 stub
MSC03C07, 03C50
DefinesType
UsesTheory, Well-formed formula, Model, Signature
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.