# Łoś–Tarski preservation theorem

The Łoś–Tarski theorem is a theorem in model theory, a branch of mathematics, that states that the set of formulas preserved under taking substructures is exactly the set of universal formulas (Hodges 1997). The theorem was discovered by Jerzy Łoś and Alfred Tarski.

## Statement

Let ${\displaystyle T}$ be a theory in a first-order language ${\displaystyle L}$ and ${\displaystyle \Phi ({\bar {x}})}$ a set of formulas of ${\displaystyle L}$. (The set of sequence of variables ${\displaystyle {\bar {x}}}$ need not be finite.) Then the following are equivalent:

1. If ${\displaystyle A}$ and ${\displaystyle B}$ are models of ${\displaystyle T}$, ${\displaystyle A\subseteq B}$, ${\displaystyle {\bar {a}}}$ is a sequence of elements of ${\displaystyle A}$. If ${\displaystyle B\models \bigwedge \Phi ({\bar {a}})}$, then ${\displaystyle A\models \bigwedge \Phi ({\bar {a}})}$.
(${\displaystyle \Phi }$ is preserved in substructures for models of ${\displaystyle T}$)
2. ${\displaystyle \Phi }$ is equivalent modulo ${\displaystyle T}$ to a set ${\displaystyle \Psi ({\bar {x}})}$ of ${\displaystyle \forall _{1}}$ formulas of ${\displaystyle L}$.

A formula is ${\displaystyle \forall _{1}}$ if and only if it is of the form ${\displaystyle \forall {\bar {x}}[\psi ({\bar {x}})]}$ where ${\displaystyle \psi ({\bar {x}})}$ is quantifier-free.

Note that this property fails for finite models.

## References

• Peter G. Hinman (2005), Fundamentals of Mathematical Logic, A K Peters, ISBN 1568812620.
• Hodges (1997), A Shorter Model Theory, Cambridge University Press, ISBN 0521587131.