[FMFP] Mostly summarized formal reasoning

This commit is contained in:
2026-02-28 15:21:27 +01:00
parent 9d72814b56
commit c079e88fe9
13 changed files with 313 additions and 1 deletions

View File

@@ -0,0 +1,8 @@
\subsection{Natural deduction}
The rules from above here are used to construct derivations under assumptions, e.g.
$A_1, \ldots, A_n \vdash A$, which is read as ``$A$ follows from $A_1, \ldots, A_n$''.
The derivations are always represented as derivation trees and a \bi{proof} is a derivation whose root has no assumptions.
Since we have to prove a statement, we have to draw the derivation trees from the bottom up, with the goal of reaching an axiom or a rule that is an assumption
using the other rules of the rule set.