[FMFP] Final remarks and fixes

2026-09-10 19:15:25 +02:00 · 2026-08-06 15:10:54 +02:00
parent dad7286f10
commit 7cdba7dca9
10 changed files with 18 additions and 4 deletions
@@ -7,7 +7,7 @@
 The full proof for this is available on the slides for Formal Methods, pages 82 - 91 (Slide Deck 3, pages 27 - 40)

 In there, \bi{Induction on Derivation Trees} is used.
-Similar like other induction proofs, we show that a property $P(T)$ holds for all derivation trees $T$,
+Similar to other induction proofs, we show that a property $P(T)$ holds for all derivation trees $T$,
 we prove that $P(T)$ holds for an arbitrary derivation tree $T$ under the assumption (the induction hypothesis) that $P(T')$ holds for all sub-trees $T'$ of $T$

 This kind of induction is a special case of \bi{well-founded (Noetherian) induction}.