Begriffsschrift
   HOME

TheInfoList



OR:

''Begriffsschrift'' (German for, roughly, "concept-writing") is a book on
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure o ...
by
Gottlob Frege Friedrich Ludwig Gottlob Frege (; ; 8 November 1848 – 26 July 1925) 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 philos ...
, published in 1879, and the
formal system A formal system is an abstract structure and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms. In 1921, David Hilbert proposed to use formal systems as the foundation of knowledge in ma ...
set out in that book. ''Begriffsschrift'' is usually translated as ''concept writing'' or ''concept notation''; the full title of the book identifies it as "a
formula In science, a formula is a concise way of expressing information symbolically, as in a mathematical formula or a ''chemical formula''. The informal use of the term ''formula'' in science refers to the general construct of a relationship betwe ...
language Language is a structured system of communication that consists of grammar and vocabulary. It is the primary means by which humans convey meaning, both in spoken and signed language, signed forms, and may also be conveyed through writing syste ...
, modeled on that of
arithmetic Arithmetic is an elementary branch of mathematics that deals with numerical operations like addition, subtraction, multiplication, and division. In a wider sense, it also includes exponentiation, extraction of roots, and taking logarithms. ...
, for pure
thought In their most common sense, the terms thought and thinking refer to cognitive processes that can happen independently of sensory stimulation. Their most paradigmatic forms are judging, reasoning, concept formation, problem solving, and de ...
." Frege's motivation for developing his formal approach to logic resembled
Leibniz Gottfried Wilhelm Leibniz (or Leibnitz; – 14 November 1716) was a German polymath active as a mathematician, philosopher, scientist and diplomat who is credited, alongside Sir Isaac Newton, with the creation of calculus in addition to many ...
's motivation for his ''
calculus ratiocinator The ''calculus ratiocinator'' is a theoretical universal logical calculation framework, a concept described in the writings of Gottfried Leibniz, usually paired with his more frequently mentioned ''characteristica universalis'', a universal conc ...
'' (despite that, in the foreword Frege clearly denies that he achieved this aim, and also that his main aim would be constructing an ideal language like Leibniz's, which Frege declares to be a quite hard and idealistic—though not impossible—task). Frege went on to employ his logical calculus in his research on the
foundations of mathematics Foundations of mathematics are the mathematical logic, logical and mathematics, mathematical framework that allows the development of mathematics without generating consistency, self-contradictory theories, and to have reliable concepts of theo ...
, carried out over the next quarter-century. This is the first work in
Analytical Philosophy Analytic philosophy is a broad movement within Western philosophy, especially English-speaking world, anglophone philosophy, focused on analysis as a philosophical method; clarity of prose; rigor in arguments; and making use of formal logic, mat ...
, a field that later British and Anglo philosophers such as
Bertrand Russell Bertrand Arthur William Russell, 3rd Earl Russell, (18 May 1872 – 2 February 1970) was a British philosopher, logician, mathematician, and public intellectual. He had influence on mathematics, logic, set theory, and various areas of analytic ...
further developed.


Notation and the system

The calculus contains the first appearance of quantified variables, and is essentially classical bivalent
second-order logic In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic is in turn extended by higher-order logic and type theory. First-order logic quantifies on ...
with identity. It is bivalent in that sentences or formulas denote either True or False; second order because it includes relation variables in addition to object variables and allows quantification over both. The modifier "with identity" specifies that the language includes the identity relation, =. Frege stated that his book was his version of a
characteristica universalis The Latin term ''characteristica universalis'', commonly interpreted as ''universal characteristic'', or ''universal character'' in English, is a universal and formal language imagined by Gottfried Leibniz able to express mathematical, scienti ...
, a Leibnizian concept that would be applied in mathematics. In the first chapter, Frege defines basic ideas and notation: ''judgement'', ''
conditionality In political economy and international relations, conditionality is the use of conditions attached to the provision of benefits such as a loan, debt relief or bilateral aid. These conditions are typically imposed by international financial insti ...
'', ''
negation In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
'', ''identity of content'', ''functions'' and '' generality''. Frege presents his calculus in an idiosyncratic two-dimensional
notation In linguistics and semiotics, a notation system is a system of graphics or symbols, Character_(symbol), characters and abbreviated Expression (language), expressions, used (for example) in Artistic disciplines, artistic and scientific disciplines ...
, based on
negation In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
,
material conditional The material conditional (also known as material implication) is a binary operation commonly used in logic. When the conditional symbol \to is interpreted as material implication, a formula P \to Q is true unless P is true and Q is false. M ...
and
universal quantification In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by e ...
. Other
connectives In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, th ...
and
existential quantification Existentialism is a family of philosophy, philosophical views and inquiry that explore the human individual's struggle to lead an Authenticity (philosophy), authentic life despite the apparent Absurdity#The Absurd, absurdity or incomprehensibili ...
are provided as definitions. Parentheses are not needed. The conditional (B \to A) is expressed by . Regarding its meaning Frege wrote: :"If A and B stand for contents that can become judgments, there are the following four possibilities: # A is affirmed and B is affirmed; # A is affirmed and B is denied; # A is denied and B is affirmed; # A is denied and B is denied. Now : stands for the judgment that ''the third of those possibilities does not take place, but one of the three others does.''" The building blocks are: In hindsight one can say that in ''Begriffsschrift'', formulas are represented by their
parse tree A parse tree or parsing tree (also known as a derivation tree or concrete syntax tree) is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar. The term ''parse tree'' itself is use ...
s. Example Proposition 59 is written in modern notation as :\vdash g \left(b \right) \to \left(\lnot f \left(b\right) \to \lnot \left(\forall a\right)\left(g \left(a\right) \to f \left(a\right)\right)\right). The
parse tree A parse tree or parsing tree (also known as a derivation tree or concrete syntax tree) is an ordered, rooted tree that represents the syntactic structure of a string according to some context-free grammar. The term ''parse tree'' itself is use ...
is
     →
    / \
g(b)   →
      / \
     ¬   ¬
     ,    , 
  f(b)   ∀a
         , 
         →
        / \
    g(a)   f(a)
... in left-to-right horizontal layout
→ ─── → ─── ¬ ─── ∀a ─── → ─── f(a)
 \     \                  \
  g(b)  ¬                  g(a)
         \
          f(b)
In ''Begriffsschrift'', proposition 59 is represented as
├─┬─┬─┬─a̲─┬─── f(a)
  │ │     └─── g(a)
  │ └──────┬── f(b)
  └─────────── g(b)


The calculus in Frege's work

In the second chapter Frege declared nine of his propositions to be
axiom An axiom, postulate, or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The word comes from the Ancient Greek word (), meaning 'that which is thought worthy or ...
s, and justified them by arguing informally that, given their intended meanings, they express self-evident truths. Re-expressed in contemporary notation, these axioms are: # \vdash A \to (B \to A) # \vdash A \to (B \to C) \to (A \to B) \to (A \to C) # \vdash D \to (B \to A) \to B \to (D \to A) # \vdash (B \to A) \to (\lnot A \to \lnot B) # \vdash \lnot \lnot A \to A # \vdash A \to \lnot \lnot A # \vdash (c = d) \to (f(c) = f(d)) # \vdash c = c # \vdash \forall a \, f(a) \to f(c) These are propositions 1, 2, 8, 28, 31, 41, 52, 54, and 58 in the ''Begriffschrifft''. (1)–(3) govern material implication, (4)–(6)
negation In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
, (7) and (8) identity, and (9) the
universal quantifier In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by e ...
. (7) expresses
Leibniz Gottfried Wilhelm Leibniz (or Leibnitz; – 14 November 1716) was a German polymath active as a mathematician, philosopher, scientist and diplomat who is credited, alongside Sir Isaac Newton, with the creation of calculus in addition to many ...
's indiscernibility of identicals, and (8) asserts that identity is a
reflexive relation In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal to itself. A ...
. All other propositions are deduced from (1)–(9) by invoking any of the following
inference rule Rules of inference are ways of deriving conclusions from premises. They are integral parts of formal logic, serving as norms of the logical structure of valid arguments. If an argument with true premises follows a rule of inference then the co ...
s: *
Modus ponens In propositional logic, (; MP), also known as (), implication elimination, or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as "''P'' implies ''Q.'' ''P'' is true. Therefore, ''Q'' must ...
allows to infer \vdash B from \vdash A \to B and \vdash A; *The rule of generalization allows to infer \vdash P \to \forall x A(x) from \vdash P \to A(x) if ''x'' does not occur in ''P''; *The rule of substitution, which Frege does not state explicitly. This rule is much harder to articulate precisely than the two preceding rules, and Frege invokes it in ways that are not obviously legitimate. The main results of the third chapter, titled "Parts from a general series theory," concern what is now called the
ancestral An ancestor, also known as a forefather, fore-elder, or a forebear, is a parent or ( recursively) the parent of an antecedent (i.e., a grandparent, great-grandparent, great-great-grandparent and so forth). ''Ancestor'' is "any person from ...
of a relation ''R''. "''a'' is an ''R''-ancestor of ''b''" is written "''aR''*''b''". Frege applied the results from the ''Begriffsschrift'', including those on the ancestral of a relation, in his later work ''
The Foundations of Arithmetic ''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 th ...
''. Thus, if we take ''xRy'' to be the relation ''y'' = ''x'' + 1, then 0''R''*''y'' is the predicate "''y'' is a natural number." (133) says that if ''x'', ''y'', and ''z'' are
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s, then one of the following must hold: ''x'' < ''y'', ''x'' = ''y'', or ''y'' < ''x''. This is the so-called "law of
trichotomy A trichotomy can refer to: * Law of trichotomy, a mathematical law that every real number is either positive, negative, or zero ** Trichotomy theorem, in finite group theory * Trichotomy (jazz trio), Australian jazz band, collaborators with Dan ...
".


Influence on other works

For a careful recent study of how the ''Begriffsschrift'' was reviewed in the German mathematical literature, see Vilko (1998). Some reviewers, especially Ernst Schröder, were on the whole favorable. All work in formal logic subsequent to the ''Begriffsschrift'' is indebted to it, because its second-order logic was the first formal logic capable of representing a fair bit of mathematics and natural language. Some vestige of Frege's notation survives in the "
turnstile A turnstile (also called a gateline, baffle gate, automated gate, turn gate in some regions) is a form of gate which allows one person to pass at a time. A turnstile can be configured to enforce One-way traffic#One-way traffic of people, one-way ...
" symbol \vdash derived from his "Urteilsstrich" (''judging/inferring stroke'') │ and "Inhaltsstrich" (i.e. ''content stroke'') ──. Frege used these symbols in the ''Begriffsschrift'' in the unified form ├─ for declaring that a proposition is true. In his later "Grundgesetze" he revises slightly his interpretation of the ├─ symbol. In "Begriffsschrift" the "Definitionsdoppelstrich" (i.e. ''definition double stroke'') │├─ indicates that a proposition is a definition. Furthermore, the negation sign \neg can be read as a combination of the horizontal ''Inhaltsstrich'' with a vertical negation stroke. This negation symbol was reintroduced by
Arend Heyting __NOTOC__ Arend Heyting (; 9 May 1898 – 9 July 1980) was a Dutch mathematician and logician. Biography Heyting was a student of Luitzen Egbertus Jan Brouwer at the University of Amsterdam, and did much to put intuitionistic logic on a foo ...
in 1930 to distinguish
intuitionistic In the philosophy of mathematics, intuitionism, or neointuitionism (opposed to preintuitionism), is an approach where mathematics is considered to be purely the result of the constructive mental activity of humans rather than the discovery of f ...
from classical negation. It also appears in Gerhard Gentzen's doctoral dissertation. In the '' Tractatus Logico Philosophicus'',
Ludwig Wittgenstein Ludwig Josef Johann Wittgenstein ( ; ; 26 April 1889 – 29 April 1951) was an Austrian philosopher who worked primarily in logic, the philosophy of mathematics, the philosophy of mind, and the philosophy of language. From 1929 to 1947, Witt ...
pays homage to Frege by employing the term ''Begriffsschrift'' as a synonym for logical formalism. Frege's 1892 essay, "
On Sense and Reference In the philosophy of language, the distinction between sense and reference was an idea of the German philosopher and mathematician Gottlob Frege in 1892 (in his paper "On Sense and Reference"; German: "Über Sinn und Bedeutung"), reflecting the ...
," recants some of the conclusions of the ''Begriffsschrifft'' about identity (denoted in mathematics by the "=" sign). In particular, he rejects the "Begriffsschrift" view that the identity predicate expresses a relationship between names, in favor of the conclusion that it expresses a relationship between the objects that are denoted by those names.


Editions

* Translations: * * *


See also

*
Ancestral relation In mathematical logic, the ancestral relation (often shortened to ancestral) of a binary relation ''R'' is its transitive closure, however defined in a different way, see below. Ancestral relations make their first appearance in Frege's ''Begriff ...
* Calculus of equivalent statements *
First-order logic First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over ...
* Prior Analytics *
The Laws of Thought ''An Investigation of the Laws of Thought: on Which are Founded the Mathematical Theories of Logic and Probabilities'' by George Boole, published in 1854, is the second of Boole's two monographs on algebraic logic. Boole was a professor of mathe ...
*
Principia Mathematica The ''Principia Mathematica'' (often abbreviated ''PM'') is a three-volume work on the foundations of mathematics written by the mathematician–philosophers Alfred North Whitehead and Bertrand Russell and published in 1910, 1912, and 1 ...


Notes


Bibliography

* * * * * * *


External links

* *
Esoteric programming language An esoteric programming language (sometimes shortened to esolang) is a programming language designed to test the boundaries of computer programming language design, as a proof of concept, as software art, as a hacking interface to another language ...
: {{Authority control 1879 non-fiction books Books by Gottlob Frege Logic books Diagram algebras Analytic philosophy literature Philosophy of logic Classical logic Predicate logic