Proof theory · Definition
Formal proof
Before you start you need to know
A formal proof is a sequence of checkable steps that leads from the premises to the conclusion.
Definition
A formal proof of \(\varphi_n\) is a sequence \(\varphi_1,\ldots,\varphi_n\) in which each term is an axiom, an admitted hypothesis, or the result of a rule applied to earlier terms.
Each line of a formal proof must be an axiom, an allowed hypothesis or the result of applying a rule to earlier lines, so that anyone can check it step by step.
Guiding example: from the hypotheses \(P\) and \(P\to Q\) we obtain \(Q\). The proof has three lines: \(P\), \(P\to Q\) and \(Q\), the last justified by modus ponens on the two previous ones.
Typical error: writing a line without justification because it seems obvious. A jump from \(P\) to \(Q\) without a rule leaves a gap, and the proof stops being formal.
Think about it
Can a correct conclusion be part of a proof if it is not justified?
No. A formal proof also requires justifying the steps that lead to a true conclusion.
Exercises 10
- A formal proof is a...
- Each line of a formal proof must be...
- The last line of a proof is usually...
- A formal proof depends on...
- Which step does not belong to a formal proof?
- A formal proof is a sequence of...
- The first step of a proof can be...
- A line of a proof must be justifiable by...
- A formal proof has the lines \(P\to Q\) and \(P\), both allowed hypotheses. Which line can legitimately be added?
- If a proof jumps from P to Q without a rule that allows it, then...
What comes next
References
- Frederic P. Schuller, Lectures on the Geometrical Anatomy of Theoretical Physics · Lecture 1, Introduction / Logic of Propositions and Predicates, YouTube, 2015.