Jump to content

Atomic model (mathematical logic)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hans Adler (talk | contribs) at 21:54, 2 May 2008 (Examples: I don't think it's true in general, because the omitting types theorem is used in the proof). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In model theory, an atomic model is a model which is in some sense small.

Definitions

A formula φ(x1,...,xn) in a complete theory T is called complete if for every other formula ψ(x1,...,xn), the formula φ implies exactly one of ψ and ¬ψ in T.

A model M of the theory is called atomic if every n-tuple of elements of M satisfies a complete formula.

Examples

  • The ordered field of real algebraic numbers is the unique atomic model of the theory of real closed fields.
  • Any finite model is atomic
  • A dense linear ordering without endpoints is atomic.
  • Any prime model of a countable theory is atomic.
  • Any countable atomic model is prime, but there are plenty of atomic models that are not prime, such as an uncountable dense linear order without endpoints.
  • The theory of a countable number of independent unary relations is complete but has no completable formulas and no atomic models.

Properties

The back and forth method can be usesd to show that any two countable atomic models of a theory that are elementarily equivalent are isomorphic.

References

Chang, Chen Chung; Keisler, H. Jerome (1990) [1973], Model Theory, Studies in Logic and the Foundations of Mathematics (3rd ed.), Elsevier, ISBN 978-0-444-88054-3