Robinson's joint consistency theorem
Template:Short description Robinson's joint consistency theorem is an important theorem of mathematical logic. It is related to Craig interpolation and Beth definability.
The classical formulation of Robinson's joint consistency theorem is as follows:
Let and be first-order theories. If and are consistent and the intersection is complete (in the common language of and ), then the union is consistent. A theory is called complete if it decides every formula, meaning that for every sentence the theory contains the sentence or its negation but not both (that is, either or ).
Since the completeness assumption is quite hard to fulfill, there is a variant of the theorem:
Let and be first-order theories. If and are consistent and if there is no formula in the common language of and such that and then the union is consistent.
Proof
For a first-order language and a set , let denote the language obtained from by adding 0-ary operations bijectively corresponding to the set . For a first-order language , an -structure and a subset , let denote the -structure obtained from by interpreting each 0-ary operation as itself. For a first-order language , its expansion and an -structure , let denote the reduct of in .
Let be a first-order language and and its expansions such that . Let be a consistent theory in and a consistent theory in . Suppose that is a complete theory in . We shall show that is a consistent theory.
Using the compactness theorem, it is not hard to show that, for every -structure and an -structure , if is elementarily equivalent to , then the theory
is satisfiable.
For an -structure and an -structure , if is elementarily equivalent to , then for some -structure , there exist an -elementary embedding and an -elementary embedding . Indeed, take an -model
and put .
Now take a model and a model . Since is an -complete theory, we have . Therefore, there exist an -structure , an -elementary embedding and an -elementary embedding . Again, since and is elementarily equivalent to , there exist an -structure , -elementary embedding and an -elementary embedding . In particular, there exist an -structure , an -elementary embedding and an -elementary embedding .
By induction, there exist -structures , -structures and elementary embeddings
which make the following diagram commute.
(In the above diagram, the horizontal arrows are elementary embeddings in or , and the vertical and diagonal arrows are elementary embeddings in .) Finally, the colimit of the above diagram is easily seen to be a model of .
See also
References
- Template:Cite book
- Robinson, Abraham, 'A result on consistency and its application to the theory of definition', Proc. Royal Academy of Sciences, Amsterdam, series A, vol 59, pp 47-58.