Robinson's joint consistency theorem

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 $T_1$ and $T_2$ be first-order theories. If $T_1$ and $T_2$ are consistent and the intersection $T_1\cap T_2$ is complete (in the common language of $T_1$ and $T_2$), then the union $T_1\cup T_2$ is consistent. A theory $T$ is called complete if it decides every formula, meaning that for every sentence $\phi ,$ the theory contains the sentence or its negation but not both (that is, either $T⊢\phi$ or $T⊢\mathrm{\neg }\phi$).

Since the completeness assumption is quite hard to fulfill, there is a variant of the theorem:

Let $T_1$ and $T_2$ be first-order theories. If $T_1$ and $T_2$ are consistent and if there is no formula $\phi$ in the common language of $T_1$ and $T_2$ such that $T_1⊢\phi$ and $T_2⊢\mathrm{\neg }\phi ,$ then the union $T_1\cup T_2$ is consistent.

See also

• Łoś–Vaught test

References

• Boolos, George S.; Burgess, John P.; Jeffrey, Richard C. (2002). Computability and Logic. Cambridge University Press. pp. 264. ISBN 0-521-00758-5. https://books.google.com/books?id=Yy14JSjPyY8C. 
• 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.