Fitch notation, also known as Fitch diagrams (named after
Frederic Fitch), is a method of presenting
natural deduction
In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the "natural" way of reasoning. This contrasts with Hilbert-style systems, which instead use ...
proofs in
propositional calculus
The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
and
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 ...
s using a structured, line-by-line format that explicitly shows assumptions, inferences, and their scope. It was invented by
Frederic Brenton Fitch in the 1930s and later popularized through his textbook ''Symbolic Logic'' (1952). Fitch notation is notable for its use of indentation or boxes to indicate the scope of subordinate assumptions, making it one of the most pedagogically accessible systems for teaching formal logic.
History
Fitch developed his system of natural deduction as part of his doctoral work at
Princeton University
Princeton University is a private university, private Ivy League research university in Princeton, New Jersey, United States. Founded in 1746 in Elizabeth, New Jersey, Elizabeth as the College of New Jersey, Princeton is the List of Colonial ...
in 1934, under the supervision of
Alonzo Church
Alonzo Church (June 14, 1903 – August 11, 1995) was an American computer scientist, mathematician, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer science. He is bes ...
. His approach introduced the key idea of subordinate proofs, where assumptions could be opened within a subderivation and discharged later, such as when proving implications or negations. While his system was initially circulated in unpublished form, it became widely known through his book ''Symbolic Logic'', which was used extensively in undergraduate instruction.
Later logicians and educators such as
Patrick Suppes
Patrick Colonel Suppes (; March 17, 1922 – November 17, 2014) was an American philosopher who made significant contributions to philosophy of science, the theory of measurement, the foundations of quantum mechanics, decision theory, psycholog ...
and
E. J. Lemmon rebranded Fitch's system. While they introduced graphical changes—such as replacing indentation with vertical bars—the underlying structure of Fitch-style natural deduction remained intact. These variations are often referred to as the
Suppes–Lemmon format, though they are fundamentally based on Fitch's original notation.
Structure
Fitch notation presents proofs as a sequence of numbered lines, where each line includes:
* A logical formula
* A justification (a rule name and line references)
* Optionally, indentation or brackets to show the scope of assumptions
Example
Each row in a Fitch-style proof is either:
* an assumption or subproof assumption.
* a sentence justified by the citation of (1) a
rule of inference
Rules of inference are ways of deriving conclusions from premises. They are integral parts of formal logic, serving as norms of the Logical form, logical structure of Validity (logic), valid arguments. If an argument with true premises follows a ...
and (2) the prior line or lines of the proof that license that rule.
Introducing a new assumption increases the level of indentation, and begins a new vertical "scope" bar that continues to indent subsequent lines until the assumption is discharged. This mechanism immediately conveys which assumptions are active for any given line in the proof, without the assumptions needing to be rewritten on every line (as with sequent-style proofs).
The following example displays the main features of Fitch notation:
0 , __ ssumption, want P if not P1 , , __ P ssumption, want not P2 , , , __ not P ssumption, for reduction3 , , , contradiction ontradiction introduction: 1, 24 , , not not P egation introduction: 2 ,
5 , , __ not not P ssumption, want P6 , , P egation elimination: 5 ,
7 , P iff not not P iconditional introduction: 1 - 4, 5 - 6
- The null assumption, ''i.e.'', we are proving a tautology
- Our first subproof: we assume the l.h.s. to show the r.h.s. follows
- A subsubproof: we are free to assume what we want. Here we aim for a
reductio ad absurdum
In logic, (Latin for "reduction to absurdity"), also known as (Latin for "argument to absurdity") or ''apagogical argument'', is the form of argument that attempts to establish a claim by showing that the opposite scenario would lead to absur ...
- We now have a contradiction
- We are allowed to prefix the statement that "caused" the contradiction with a not
- Our second subproof: we assume the r.h.s. to show the l.h.s. follows
- We invoke the rule that allows us to remove an even number of nots from a statement prefix
- From 1 to 4 we have shown if P then not not P, from 5 to 6 we have shown P if not not P; hence we are allowed to introduce the biconditional in 7, where ''iff'' stands for ''if and only if''
Features
* Subordinate proofs: Nested derivations with temporarily assumed premises
* Assumption discharge: Explicit rules like
introduction and
introduction for closing assumptions
* Line-referenced justification: Each step cites lines and rules used
* Human readability: The format closely mirrors natural informal reasoning
Comparison with Other Systems
*
Gentzen-style natural deduction presents proofs as trees, with assumptions at the leaves and conclusions at the root. Unlike Fitch notation, it does not use subordinate boxes or indentation to manage temporary assumptions. Instead, all assumptions are explicitly present in the leaf nodes of the proof tree. This uniform treatment of assumptions makes Gentzen systems particularly well-suited to structural proof transformations and facilitates modularization and meta-theoretical analysis, such as cut-elimination.
*
Hilbert system
In logic, more specifically proof theory, a Hilbert system, sometimes called Hilbert calculus, Hilbert-style system, Hilbert-style proof system, Hilbert-style deductive system or Hilbert–Ackermann system, is a type of formal proof Proof calcu ...
proofs rely on axioms and only a few inference rules, making them concise but abstract and less intuitive.
* The
Suppes–Lemmon notation follows Fitch's logic and alters its visual layout for typesetting and instructional clarity.
Influence
Fitch notation is widely used in
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 ...
textbooks and teaching. It also underlies several
proof assistant
In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of formal proofs by human–machine collaboration. This involves some sort of interactive proof edi ...
tools. Its structured style has become a standard for teaching formal logic in undergraduate education.
See also
*
Natural deduction
In logic and proof theory, natural deduction is a kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the "natural" way of reasoning. This contrasts with Hilbert-style systems, which instead use ...
*
Frederic Fitch
*
Sequent calculus
In mathematical logic, sequent calculus is a style of formal logical argumentation in which every line of a proof is a conditional tautology (called a sequent by Gerhard Gentzen) instead of an unconditional tautology. Each conditional tautolog ...
*
Proof theory
Proof theory is a major branchAccording to , proof theory is one of four domains mathematical logic, together with model theory, axiomatic set theory, and recursion theory. consists of four corresponding parts, with part D being about "Proof The ...
*
Hilbert system
In logic, more specifically proof theory, a Hilbert system, sometimes called Hilbert calculus, Hilbert-style system, Hilbert-style proof system, Hilbert-style deductive system or Hilbert–Ackermann system, is a type of formal proof Proof calcu ...
*
Suppes–Lemmon notation
Notes
References
*
*
*
*
External links
*
*
*
* (see
Jape)
* (see
LaTeX
Latex is an emulsion (stable dispersion) of polymer microparticles in water. Latices are found in nature, but synthetic latices are common as well.
In nature, latex is found as a wikt:milky, milky fluid, which is present in 10% of all floweri ...
)
*
* {{cite web, url=https://proofs.openlogicproject.org/, title= Natural deduction proof editor and checker in Fitch notation, access-date=2025-05-06
Philosophical logic
Logical calculi