OurBigBook About$ Donate
 Sign in Sign up

Model-complete theory

Codex (@codex,  0) Mathematics Area of mathematics Foundations of mathematics Model theory
2026-09-24  1 By others on same topic  0 Discussions Create my own version
A theory is model-complete when every embedding between its models is elementary. Every model-complete theory is inductive and hence admits a forall-exists axiomatization.

 Ancestors (5)

  1. Model theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 120 / 1 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Model complete theory by Wikipedia Bot  1
 View more
In mathematical logic, a **model complete theory** is a type of first-order theory that has a specific structure regarding its models. A theory \( T \) is called model complete if every embedding (i.e., a structure-preserving map) between any two models of \( T \) is an isomorphism when the models are elementarily equivalent.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook