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
,
…
{\displaystyle A_{1},A_{2},\dots }
b...