Frege's theorem

Last updated

In metalogic and metamathematics, Frege's theorem is a metatheorem that states that the Peano axioms of arithmetic can be derived in second-order logic from Hume's principle. It was first proven, informally, by Gottlob Frege in his 1884 Die Grundlagen der Arithmetik ( The Foundations of Arithmetic ) [1] and proven more formally in his 1893 Grundgesetze der Arithmetik I (Basic Laws of Arithmetic I). [2] The theorem was re-discovered by Crispin Wright in the early 1980s and has since been the focus of significant work. It is at the core of the philosophy of mathematics known as neo-logicism (at least of the Scottish School variety).

Contents

Overview

In The Foundations of Arithmetic (1884), and later, in Basic Laws of Arithmetic (vol. 1, 1893; vol. 2, 1903), Frege attempted to derive all of the laws of arithmetic from axioms he asserted as logical (see logicism). Most of these axioms were carried over from his Begriffsschrift ; the one truly new principle was one he called the Basic Law V [2] (now known as the axiom schema of unrestricted comprehension): [3] the "value-range" of the function f(x) is the same as the "value-range" of the function g(x) if and only if ∀x[f(x) = g(x)]. However, not only did Basic Law V fail to be a logical proposition, but the resulting system proved to be inconsistent, because it was subject to Russell's paradox. [4]

The inconsistency in Frege's Grundgesetze overshadowed Frege's achievement: according to Edward Zalta, the Grundgesetze "contains all the essential steps of a valid proof (in second-order logic) of the fundamental propositions of arithmetic from a single consistent principle." [4] This achievement has become known as Frege's theorem. [4] [5]

Frege's theorem in propositional logic

(P(QR))((PQ)(PR))
Dark Red x.svgGreen check.svgDark Red x.svgDark Red x.svgGreen check.svgGreen check.svg
Dark Red x.svgGreen check.svgDark Red x.svgYes check.svgGreen check.svgGreen check.svg
Dark Red x.svgGreen check.svgYes check.svgDark Red x.svgGreen check.svgGreen check.svg
Dark Red x.svgGreen check.svgYes check.svgYes check.svgGreen check.svgGreen check.svg
Yes check.svgGreen check.svgDark Red x.svgDark Red x.svgGreen check.svgGreen check.svg
Yes check.svgGreen check.svgDark Red x.svgYes check.svgGreen check.svgGreen check.svg
Yes check.svgRed x.svgYes check.svgDark Red x.svgGreen check.svgRed x.svg
Yes check.svgGreen check.svgYes check.svgYes check.svgGreen check.svgGreen check.svg
12345678910111213

In propositional logic, Frege's theorem refers to this tautology:

(P → (QR)) → ((PQ) → (PR))

The theorem already holds in one of the weakest logics imaginable, the constructive implicational calculus. The proof under the Brouwer–Heyting–Kolmogorov interpretation reads . In words: "Let f denote a reason that P implies that Q implies R. And let g denote a reason that P implies Q. Then given a f, then given a g, then given a reason p for P, we know that both Q holds by g and that Q implies R holds by f. So R holds."

The truth table to the right gives a semantic proof. For all possible assignments of false () or true () to P, Q, and R (columns 1, 3, 5), each subformula is evaluated according to the rules for material conditional, the result being shown below its main operator. Column 6 shows that the whole formula evaluates to true in every case, i.e. that it is a tautology. In fact, its antecedent (column 2) and its consequent (column 10) are even equivalent.

Notes

  1. Gottlob Frege, Die Grundlagen der Arithmetik , Breslau: Verlag von Wilhelm Koebner, 1884, §63.
  2. 1 2 Gottlob Frege, Grundgesetze der Arithmetik I, Jena: Verlag Hermann Pohle, 1893, §§20 and 47.
  3. Richard Pettigrew, "Basic set theory", January 26, 2012, p. 2.
  4. 1 2 3 Zalta, Edward (2013), "Frege's Theorem and Foundations for Arithmetic", Stanford Encyclopedia of Philosophy .
  5. Boolos, George (1998). Logic, Logic, and Logic . Edited by Richard C. Jeffrey, introduction by John P. Burgess. Cambridge, Mass: Harvard University Press. p.  154. ISBN   9780674537675. OCLC   37509971. Frege's startling discovery, of which he may or may not have been fully aware and which has been lost to view since the discovery of Russell's paradox, was that arithmetic can be derived in a purely logical system like that of his Begriffsschrift from this consistent principle and from it alone.

Related Research Articles

Automated theorem proving is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. Automated reasoning over mathematical proof was a major motivating factor for the development of computer science.

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics, and suffices for the everyday use of set theory concepts in contemporary mathematics.

<span class="mw-page-title-main">Logical connective</span> Symbol connecting sentential formulas in logic

In logic, a logical connective is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the binary connective can be used to join the two atomic formulas and , rendering the complex formula .

In the philosophy of mathematics, intuitionism, or neointuitionism, is an approach where mathematics is considered to be purely the result of the constructive mental activity of humans rather than the discovery of fundamental principles claimed to exist in an objective reality. That is, logic and mathematics are not considered analytic activities wherein deep properties of objective reality are revealed and applied, but are instead considered the application of internally consistent methods used to realize more complex mental constructs, regardless of their possible independent existence in an objective reality.

Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics.

In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th-century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of whether number theory is consistent and complete.

In mathematical logic, Russell's paradox is a set-theoretic paradox published by the British philosopher and mathematician Bertrand Russell in 1901. Russell's paradox shows that every set theory that contains an unrestricted comprehension principle leads to contradictions. The paradox had already been discovered independently in 1899 by the German mathematician Ernst Zermelo. However, Zermelo did not publish the idea, which remained known only to David Hilbert, Edmund Husserl, and other academics at the University of Göttingen. At the end of the 1890s, Georg Cantor – considered the founder of modern set theory – had already realized that his theory would lead to a contradiction, as he told Hilbert and Richard Dedekind by letter.

<span class="mw-page-title-main">Gottlob Frege</span> German philosopher, logician, and mathematician (1848–1925)

Friedrich Ludwig Gottlob Frege was a German philosopher, logician, and mathematician. He was a mathematics professor at the University of Jena, and is understood by many to be the father of analytic philosophy, concentrating on the philosophy of language, logic, and mathematics. Though he was largely ignored during his lifetime, Giuseppe Peano (1858–1932), Bertrand Russell (1872–1970), and, to some extent, Ludwig Wittgenstein (1889–1951) introduced his work to later generations of philosophers. Frege is widely considered to be the greatest logician since Aristotle, and one of the most profound philosophers of mathematics ever.

Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories. These results, published by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The theorems are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible.

The history of logic deals with the study of the development of the science of valid inference (logic). Formal logics developed in ancient times in India, China, and Greece. Greek methods, particularly Aristotelian logic as found in the Organon, found wide application and acceptance in Western science and mathematics for millennia. The Stoics, especially Chrysippus, began the development of predicate logic.

<span class="mw-page-title-main">Metamathematics</span> Study of mathematics itself

Metamathematics is the study of mathematics itself using mathematical methods. This study produces metatheories, which are mathematical theories about other mathematical theories. Emphasis on metamathematics owes itself to David Hilbert's attempt to secure the foundations of mathematics in the early part of the 20th century. Metamathematics provides "a rigorous mathematical technique for investigating a great variety of foundation problems for mathematics and logic". An important feature of metamathematics is its emphasis on differentiating between reasoning from inside a system and from outside a system. An informal illustration of this is categorizing the proposition "2+2=4" as belonging to mathematics while categorizing the proposition "'2+2=4' is valid" as belonging to metamathematics.

Hume's principle or HP says that the number of Fs is equal to the number of Gs if and only if there is a one-to-one correspondence between the Fs and the Gs. HP can be stated formally in systems of second-order logic. Hume's principle is named for the Scottish philosopher David Hume and was coined by George Boolos.

<span class="mw-page-title-main">George Boolos</span> American philosopher and mathematical logician

George Stephen Boolos was an American philosopher and a mathematical logician who taught at the Massachusetts Institute of Technology.

In the philosophy of mathematics, logicism is a programme comprising one or more of the theses that – for some coherent meaning of 'logic' – mathematics is an extension of logic, some or all of mathematics is reducible to logic, or some or all of mathematics may be modelled in logic. Bertrand Russell and Alfred North Whitehead championed this programme, initiated by Gottlob Frege and subsequently developed by Richard Dedekind and Giuseppe Peano.

<i>Begriffsschrift</i> 1879 book on logic by Gottlob Frege

Begriffsschrift is a book on logic by Gottlob Frege, published in 1879, and the formal system set out in that book.

In the philosophy of language, the context principle is a form of semantic holism holding that a philosopher should "never ... ask for the meaning of a word in isolation, but only in the context of a proposition".

<i>The Foundations of Arithmetic</i> Book by Gottlob Frege

The Foundations of Arithmetic is a book by Gottlob Frege, published in 1884, which investigates the philosophical foundations of arithmetic. Frege refutes other idealist and materialist theories of number and develops his own platonist theory of numbers. The Grundlagen also helped to motivate Frege's later works in logicism.

In proof theory, a discipline within mathematical logic, double-negation translation, sometimes called negative translation, is a general approach for embedding classical logic into intuitionistic logic. Typically it is done by translating formulas to formulas that are classically equivalent but intuitionistically inequivalent. Particular instances of double-negation translations include Glivenko's translation for propositional logic, and the Gödel–Gentzen translation and Kuroda's translation for first-order logic.

In mathematical logic, the ancestral relation of a binary relation R is its transitive closure, however defined in a different way, see below.

Class logic is a logic in its broad sense, whose objects are called classes. In a narrower sense, one speaks of a class logic only if classes are described by a property of their elements. This class logic is thus a generalization of set theory, which allows only a limited consideration of classes.

References