Mathematical logic and foundations Definition
Complete theory
Definition
Let be a signature and let be an -theory. For an -sentence , write when every model of satisfies . The theory is complete when the following hold.
- has a model.
- For every -sentence , or .
Remarks
Example: for any -structure , the theory of all sentences true in is complete. It has the model , and for each sentence either or is true in , hence lies in .
Non-example: the theory of groups has a model but is not complete. For , the group satisfies and the symmetric group satisfies .
A satisfiable theory is complete if and only if all its models are elementarily equivalent. By the completeness theorem, can be replaced by , provability from . Some authors do not require clause 1.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Model concept
- Sentence concept
- Theory concept
- Complete theory definition
Further reading
About this page
| Tag | NN6QM9JMKB |
|---|---|
| URI | m2://NN6QM9JMKB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03C35, 03C07 |
| Defines | Complete theory |
| Uses | Theory, Model, Sentence |
| 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.