Craig's theorem

Craig's theorem 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 logician, William Craig.

Contents 1 Recursive axiomatization 2 Primitive recursive axiomatizations 3 Philosophical implications 4 References Recursive axiomatization Let {displaystyle A_{1},A_{2},dots } be an enumeration of the axioms of a recursively enumerable set T of first-order formulas. Construct another set T* consisting of {displaystyle underbrace {A_{i}land dots land 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 recursive set. A decision procedure for T* lends itself according to the following informal reasoning. Each member of T* is either {displaystyle A_{1}} or of the form {displaystyle underbrace {B_{j}land dots land B_{j}} _{j}.} Since each formula has finite length, it is checkable whether or not it is {displaystyle A_{1}} or of the said form. If it is of the said form and consists of j conjuncts, it is in T* if the (reoccurring) conjunct is {displaystyle A_{j}} ; otherwise it is not in T*. Again, it is checkable whether the conjunct is in fact {displaystyle 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 {displaystyle A_{i}} with {displaystyle underbrace {A_{i}land dots land A_{i}} _{i}} one instead replaces it with {displaystyle underbrace {A_{i}land dots land A_{i}} _{f(i)}} (*) where f(x) is a function that, given i, returns a computation history showing that {displaystyle A_{i}} is in the original recursively enumerable set of axioms. It is possible for a primitive recursive function to parse an expression of form (*) to obtain {displaystyle A_{i}} and j. Then, because Kleene's T predicate is primitive recursive, it is possible for a primitive recursive function to verify that j is indeed a computation history as required.

Philosophical implications If {displaystyle T} is a recursively axiomatizable theory and we divide its predicates into two disjoint sets {displaystyle V_{A}} and {displaystyle V_{B}} , then those theorems of {displaystyle T} that are in the vocabulary {displaystyle V_{A}} are recursively enumerable, and hence, based on Craig's theorem, axiomatizable. Carl G. Hempel argued based on this that since all science's predictions are in the vocabulary of observation terms, the theoretical vocabulary of science is in principle eliminable. He himself raised two objections to this argument: 1) the new axioms of science are practically unmanageable, and 2) science uses inductive reasoning and eliminating theoretical terms may alter the inductive relations between observational sentences. Hilary Putnam argues that this argument is based on a misconception that the sole aim of science is successful prediction. He proposes that the main reason we need theoretical terms is that we wish to talk about theoretical entities (such as viruses, radio stars, and elementary particles).

References William Craig. "On Axiomatizability Within a System", The Journal of Symbolic Logic, Vol. 18, No. 1 (1953), pp. 30-32. Hilary Putnam. "Craig's Theorem", The Journal of Philosophy, Vol. 62, No. 10 (1965), pp. 251.260. Categories: Computability theoryTheorems in the foundations of mathematics

Si quieres conocer otros artículos parecidos a Craig's theorem puedes visitar la categoría Computability theory.

Deja una respuesta

Tu dirección de correo electrónico no será publicada.

Subir

Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información