Propositional calculus à la Hilbert
Classical propositional logic may be axiomatized as a proof system à la Hilbert with the following inference rules1
- tautology:
𝜙 ⊢ ⊤ - explosion:
⊥ ⊢ 𝜙 -commutativity:∨ 𝜙 ∨ 𝜓 ⊣ ⊢ 𝜓 ∨ 𝜙 -commutativity:∧ 𝜙 ∧ 𝜓 ⊣ ⊢ 𝜓 ∧ 𝜙 -associativity:∨ [ 𝜙 ∨ 𝜓 ] ∨ 𝛿 ⊣ ⊢ 𝜙 ∨ [ 𝜓 ∨ 𝜙 ] -associativity:∧ [ 𝜙 ∧ 𝜓 ] ∧ 𝛿 ⊣ ⊢ 𝜙 ∧ [ 𝜓 ∧ 𝜙 ] - De Morgan's laws:
¬ [ 𝜙 ∨ 𝜓 ] ⊣ ⊢ ¬ 𝜙 ∧ ¬ 𝜓 ¬ 𝜙 ∨ ¬ 𝜓 ⊣ ⊢ ¬ [ 𝜙 ∧ 𝜓 ]
- double negation:
¬ ¬ 𝜙 ⊣ ⊢ 𝜙 - LEM:
⊤ ⊢ 𝜙 ∨ ¬ 𝜙 - non-contradiction:
𝜙 ∧ ¬ 𝜙 ⊢ ⊥ - contraposition:
𝜙 ⇒ 𝜓 ⊣ ⊢ ¬ 𝜓 ⇒ ¬ 𝜙 -absorption∨ 𝜙 ∨ ( 𝜙 ∧ 𝜓 ) ⊣ ⊢ 𝜙 𝜙 ∨ 𝜙 ⊣ ⊢ 𝜙 ⊤ ⊢ 𝜙 ∨ ⊤ 𝜙 ∨ ⊥ ⊣ ⊢ 𝜙
-absorption∧ 𝜙 ∧ ( 𝜙 ∨ 𝜓 ) ⊣ ⊢ 𝜙 𝜙 ∧ 𝜙 ⊣ ⊢ 𝜙 ⊤ ⊢ 𝜙 ∧ ⊤ 𝜙 ∧ ⊥ ⊢ ⊥
All of these are justified by the Truth table semantics for classical propositional logic.
#state/tidy | #lang/en | #SemBr