14
Destruction rules and rewriting rules
Logic and Functional Programming
Disclaimer
Course announcement
1
Well-formed formulas
2
Height and sub-formulas
3
Boolean values and pattern matching
4
A toy implementation of propositional formulas
5
Semantics of propositional logic
6
Semantic consequence and deductive reasoning
7
Interpretation of well-formed formulas in Rocq
8
Hilbert systems
9
Formal proofs for Hilbert systems
10
Natural deduction
11
Formal proofs for natural deduction
12
Conjunction, disjunction and equivalence
13
Falsity, negation and excluded middle
14
Destruction rules and rewriting rules
Table of contents
14.1
Destruction rules
14.2
Rewriting rules
14
Destruction rules and rewriting rules
14.1
Destruction rules
14.2
Rewriting rules
13
Falsity, negation and excluded middle