Tarski-Vaught test
From Wikipedia, the free encyclopedia
The Tarski-Vaught test (sometimes called Tarski's criterion) is a result in model theory which characterizes the elementary substructures of a given structure using definable sets. It is often used to determine whether a substructure of a structure is elementary, and is particularly useful in the construction of elementary substructures. Formally,
- For a given first-order language , let be a structure with domain N, and be a substructure of with domain M (written ). Then is an elementary substructure of (written ) if and only if for every nonempty definable in with parameters from M, A contains an element of M.
[edit] Proof
First suppose . Let be nonempty and definable in using with parameters . We must prove . Since , we have
(Note that the bracket notation here is used to indicate the semantic evaluation of the free variables of the formula.) But then, by definition of an elementary substructure,
Thus there exists an such that . Again by definition of elementary substructure, , so . Thus as desired.
Conversely, suppose every nonempty subset of N definable in with parameters from M contains an element of M. We prove by induction on formulas. The atomic and boolean cases are immediate from definitions since . Suppose the result holds for and consider . Since , it is immediate that for any , if , then . Suppose now for some . Thus for all ,
so by the induction hypothesis, for all ,
- (*)
Now consider the set defined in by using parameters . If there exists such that , then . By our hypothesis then, there exists an . But this contradicts (*). Thus . It follows that as desired. Q.E.D.
[edit] Example
Consider the structure consisting of the naturals with the usual ordering. Let be the substructure consisting of the prime naturals with the induced ordering. Is an elementary substructure of ? Tarski's criterion provides an immediate negative answer since, for example, the number 4 is definable in without parameters by the formula
which states (in ) 'there exist exactly 3 things less than me'.
[edit] References
- Slaman, Theodore A. and W. Hugh Woodin. Mathematical Logic: The Berkeley Undergraduate Course. Spring 2006.