To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

Interpretation (model theory)

From Wikipedia, the free encyclopedia

In model theory, interpretation of a structure M in another structure N (typically of a different signature) is a technical notion that approximates the idea of representing M inside N. For example, every reduct or definitional expansion of a structure N has an interpretation in N.

Many model-theoretic properties are preserved under interpretability. For example, if the theory of N is stable and M is interpretable in N, then the theory of M is also stable.

Note that in other areas of mathematical logic, the term "interpretation" may refer to a structure,[1][2] rather than being used in the sense defined here. These two notions of "interpretation" are related but nevertheless distinct.

YouTube Encyclopedic

  • 1/3
    769 986
    1 334 453
    936 644
  • Pilot Wave Theory and Quantum Realism | Space Time | PBS Digital Studios
  • Measuring Personality: Crash Course Psychology #22
  • The History of Atomic Chemistry: Crash Course Chemistry #37



An interpretation of a structure M in a structure N with parameters (or without parameters, respectively) is a pair where n is a natural number and is a surjective map from a subset of Nn onto M such that the -preimage (more precisely the -preimage) of every set X ⊆ Mk definable in M by a first-order formula without parameters is definable (in N) by a first-order formula with parameters (or without parameters, respectively)[clarification needed]. Since the value of n for an interpretation is often clear from context, the map itself is also called an interpretation.

To verify that the preimage of every definable (without parameters) set in M is definable in N (with or without parameters), it is sufficient to check the preimages of the following definable sets:

  • the domain of M;
  • the diagonal of M2;
  • every relation in the signature of M;
  • the graph of every function in the signature of M.

In model theory the term definable often refers to definability with parameters; if this convention is used, definability without parameters is expressed by the term 0-definable. Similarly, an interpretation with parameters may be referred to as simply an interpretation, and an interpretation without parameters as a 0-interpretation.


If L, M and N are three structures, L is interpreted in M, and M is interpreted in N, then one can naturally construct a composite interpretation of L in N. If two structures M and N are interpreted in each other, then by combining the interpretations in two possible ways, one obtains an interpretation of each of the two structures in itself. This observation permits one to define an equivalence relation among structures, reminiscent of the homotopy equivalence among topological spaces.

Two structures M and N are bi-interpretable if there exists an interpretation of M in N and an interpretation of N in M such that the composite interpretations of M in itself and of N in itself are definable in M and in N, respectively (the composite interpretations being viewed as operations on M and on N).


The partial map f from Z × Z onto Q that maps (xy) to x/y if y ≠ 0 provides an interpretation of the field Q of rational numbers in the ring Z of integers (to be precise, the interpretation is (2, f)). In fact, this particular interpretation is often used to define the rational numbers. To see that it is an interpretation (without parameters), one needs to check the following preimages of definable sets in Q:

  • the preimage of Q is defined by the formula φ(xy) given by ¬ (y = 0);
  • the preimage of the diagonal of Q is defined by the formula φ(x1, y1, x2, y2) given by x1 × y2 = x2 × y1;
  • the preimages of 0 and 1 are defined by the formulas φ(xy) given by x = 0 and x = y;
  • the preimage of the graph of addition is defined by the formula φ(x1, y1, x2, y2, x3, y3) given by x1×y2×y3 + x2×y1×y3 = x3×y1×y2;
  • the preimage of the graph of multiplication is defined by the formula φ(x1, y1, x2, y2, x3, y3) given by x1×x2×y3 = x3×y1×y2.


  1. ^ Goldblatt, Robert (2006). "11.2 Formal Language and Semantics". Topoi : the categorial analysis of logic (2nd ed.). Mineola, N.Y.: Dover Publications. ISBN 978-0-486-31796-0. OCLC 853624133.
  2. ^ Hodges, Wilfrid (2009). "Functional Modelling and Mathematical Models". In Meijers, Anthonie (ed.). Philosophy of technology and engineering sciences. Handbook of the Philosophy of Science. Vol. 9. Elsevier. ISBN 978-0-444-51667-1.
This page was last edited on 21 September 2023, at 03:56
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.