Robinson's joint consistency theorem

From testwiki
Jump to navigation Jump to search

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 T1 and T2 be first-order theories. If T1 and T2 are consistent and the intersection T1∩T2 is complete (in the common language of T1 and T2), then the union T1∪T2 is consistent. A theory T 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 T⊢φ or T⊢¬φ).

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

Let T1 and T2 be first-order theories. If T1 and T2 are consistent and if there is no formula φ in the common language of T1 and T2 such that T1⊢φ and T2⊢¬φ, then the union T1∪T2 is consistent.

Proof

For a first-order language L and a set S, let LS denote the language obtained from L by adding 0-ary operations bijectively corresponding to the set S. For a first-order language L, an L-structure M and a subset S⊆M, let MS denote the LS-structure obtained from M by interpreting each 0-ary operation s∈S as s itself. For a first-order language L, its expansion L′ and an L′-structure M, let M↾L denote the reduct of M in L.

Let L be a first-order language and L1 and L2 its expansions such that L1∩L2=L. Let T1 be a consistent theory in L1 and T2 a consistent theory in L2. Suppose that T1∩T2 is a complete theory in L. We shall show that T1∪T2 is a consistent theory.

Using the compactness theorem, it is not hard to show that, for every L1-structure M and an L2-structure N, if M↾L is elementarily equivalent to N↾L, then the theory

Th⁡(MM)∪Th⁡((N↾L)N)

is satisfiable.

For an L1-structure M and an L2-structure N, if M↾L is elementarily equivalent to N↾L, then for some L1-structure M′, there exist an L1-elementary embedding M↪M′ and an L-elementary embedding N↾L↪M′↾L. Indeed, take an (L1)M,N-model

M″⊨Th⁡(MM)∪Th⁡((N↾L)N)

and put M′=M″↾L1.

Now take a model M0⊨T1 and a model N0⊨T2. Since T1∩T2 is an L-complete theory, we have T1∩T2=Th⁡(M0↾L)=Th⁡(N0↾L). Therefore, there exist an L2-structure N1, an L2-elementary embedding N0↪N1 and an L-elementary embedding M0↾L↪N1↾L. Again, since (L1)M0∩(L2)M0=LM0 and (M0↾L)M0 is elementarily equivalent to (N1↾L)M0, there exist an (L1)M0-structure (M1)M0, (L1)M0-elementary embedding (M0)M0↪(M1)M0 and an LM0-elementary embedding (N1↾L)M0↪(M1↾L)M0. In particular, there exist an L2-structure M1, an L1-elementary embedding M0↪M1 and an L-elementary embedding N1↾L↪M1↾L.

By induction, there exist L1-structures M0,M1,…, L2-structures N0,N1,… and elementary embeddings

Mi↪Mi+1
Ni↪Ni+1
Mi↾L↪Ni+1↾L
Ni+1↾L↪Mi+1↾L

which make the following diagram commute.

M0→M1→M2→⋯↘↑↘↑↘⋯N0→N1→N2→⋯

(In the above diagram, the horizontal arrows are elementary embeddings in L1 or L2, and the vertical and diagonal arrows are elementary embeddings in L.) Finally, the colimit of the above diagram is easily seen to be a model of T1∪T2.

See also

References

Template:Reflist

  • 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.

Template:Mathematical logic


Template:Logic-stub Template:Mathlogic-stub