**Mathematical logic**is a discipline within mathematics, studying formal systems in relation to the way they encode intuitive concepts of proof and computation. As a matter of history, it was developed to understand and present the work of Kurt Gödel on the foundations of mathematics. See the list of mathematical logic topics.

Table of contents |

2 The founding results 3 External links |

## The extent of mathematical logic

Although the layperson may think that mathematical logic is the *logic of mathematics*, the truth is rather that it more closely resembles the *mathematics of logic*. It comprises those parts of logic that can be modelled mathematically. Earlier appellations were symbolic logic (as opposed to philosophical logic); and metamathematics, which is now restricted as a term to some aspects of proof theory.

As a result of studies in mathematical logic one can have a rational discussion of many of the issues in the foundations of mathematics, though it would be misleading to say that the controversies that were alive in the period 1900-1925 have all been settled. While the traditional development of logic (see list of topics in logic) put heavy emphasis on *forms of arguments*, the attitude of current mathematical logic might be summed up as *the combinatorial study of content*. This covers both the *syntactic* (for example, sending a string from a formal language to a compiler program to write it as sequence of machine instructions), and the *semantic* (constructing specific models or whole sets of them, in model theory).

Much of the subject relies on the existence of efficient proof-checking algorithms. This not emphasized in traditional treatments: this may change as software advances and exposition then starts to catch up.

## The founding results

Some important results, all discovered during the 1930s, are:

- Putative proofs of universal validity of first-order formulas can be checked quickly for validity, algorithmically. In technical language, the set of proofs is primitive recursive. Essentially, this is Gödel's completeness theorem, although that theorem is usually stated in a way that does not make it obvious that it has anything to do with algorithms.
- The set of valid first-order formulas is
*not*computable, i.e., there is no algorithm for checking for universal validity. There is, however, an algorithm that behaves as follows: Given a first-order formula as its input, the algorithm eventually halts if the formula is universally valid, and runs forever otherwise. If the algorithm has been running for a trillion years, the answer remains unknown. In other words, this set is "recursively enumerable", or, as it is sometimes more suggestively put, "semi-decidable". - The set of all universally valid second-order formulas is not even recursively enumerable. This is a consequence of Gödel's incompleteness theorem.

## External links