Robinson's joint consistency theorem

From HandWiki
Revision as of 19:52, 8 February 2024 by WikiEd2 (talk | contribs) (change)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

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

Let [math]\displaystyle{ T_1 }[/math] and [math]\displaystyle{ T_2 }[/math] be first-order theories. If [math]\displaystyle{ T_1 }[/math] and [math]\displaystyle{ T_2 }[/math] are consistent and if there is no formula [math]\displaystyle{ \varphi }[/math] in the common language of [math]\displaystyle{ T_1 }[/math] and [math]\displaystyle{ T_2 }[/math] such that [math]\displaystyle{ T_1 \vdash \varphi }[/math] and [math]\displaystyle{ T_2 \vdash \neg \varphi, }[/math] then the union [math]\displaystyle{ T_1\cup T_2 }[/math] is consistent.

See also

References