 # Craig's theorem

Updated on
Covid-19

In mathematical logic, Craig's theorem states that any recursively enumerable set of well-formed formulas of a first-order language is (primitively) recursively axiomatizable. This result is not related to the well-known Craig interpolation theorem, although both results are named after the same mathematician, William Craig.

## Recursive axiomatization

Let A 1 , A 2 , be an enumeration of the axioms of a recursively enumerable set T of first-order formulas. Construct another set T* consisting of

A i A i i

for each positive integer i. The deductive closures of T* and T are thus equivalent; the proof will show that T* is a decidable set. A decision procedure for T* lends itself according to the following informal reasoning. Each member of T* is either A 1 or of the form

B j B j j .

Since each formula has finite length, it is checkable whether or not it is A 1 or of the said form. If it is of the said form and consists of j conjuncts, it is in T* if it is the expression A j ; otherwise it is not in T*. Again, it is checkable whether it is in fact A n by going through the enumeration of the axioms of T and then checking symbol-for-symbol whether the expressions are identical.

## Primitive recursive axiomatizations

The proof above shows that for each recursively enumerable set of axioms there is a recursive set of axioms with the same deductive closure. A set of axioms is primitive recursive if there is a primitive recursive function that decides membership in the set. To obtain a primitive recursive aximatization, instead of replacing a formula A i with

A i A i i