Mathematical logic and foundations Definition
Type
Builds on TheoryWell-formed formulaModelSignature
Definition
Let be a signature, let be an -theory, and let . An -type of is a set of -formulas whose free variables are among , such that is satisfiable. This means that some model of has a tuple that satisfies every formula of . The type is complete if for every -formula , either or . A model of realizes if some tuple of satisfies every formula of , and omits otherwise. The set of complete -types of is written .
Let be a model and a set of elements of . Let be extended by a new constant for each element of . A type over is a type of the -theory of . The set of complete -types over is written .
Remarks
For a tuple of a model , the set of all formulas satisfied by in is a complete type of the theory of .
Example: let be the theory of and let . Each finite part of is satisfied in by a large number, so by compactness has a model, and is a -type. The standard model omits , while every nonstandard model of realizes it.
Non-example: in the theory of fields, is not a type, since gives in every field.
The set carries a natural topology, with basic open sets ; 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
- no evidence level
- Model concept
- Signature concept
- Theory concept
- Well-formed formula concept
- Type definition
Further reading
About this page
| Tag | VA7AK1R5AN |
|---|---|
| URI | m2://VA7AK1R5AN |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03C07, 03C50 |
| Defines | Type |
| Uses | Theory, Well-formed formula, Model, Signature |
| Changed | 2 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.