Logic as a Tool Chapter 2: Deductive Reasoning in Propositional Logic 2.4 Propositional Natural Deduction Valentin Goranko Stockholm University November 2020 Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. ◮ For each logical connective: introduction rules and elimination rules. Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. ◮ For each logical connective: introduction rules and elimination rules. ◮ Introduction (opening) and cancelation ( closing, discharge) of assumptions. Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. ◮ For each logical connective: introduction rules and elimination rules. ◮ Introduction (opening) and cancelation ( closing, discharge) of assumptions. ◮ Assumptions can be re-used many times before canceled. Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. ◮ For each logical connective: introduction rules and elimination rules. ◮ Introduction (opening) and cancelation ( closing, discharge) of assumptions. ◮ Assumptions can be re-used many times before canceled. ◮ Cancelation of assumptions: only when the rules allow it, but not an obligation. Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. ◮ For each logical connective: introduction rules and elimination rules. ◮ Introduction (opening) and cancelation ( closing, discharge) of assumptions. ◮ Assumptions can be re-used many times before canceled. ◮ Cancelation of assumptions: only when the rules allow it, but not an obligation. ◮ All open assumptions at the end of the derivation must be declared. Goranko
Natural Deduction ◮ Natural Deduction (ND): System for structured logical derivation from a set of assumptions, based on rules, specific to the logical connectives. ◮ For each logical connective: introduction rules and elimination rules. ◮ Introduction (opening) and cancelation ( closing, discharge) of assumptions. ◮ Assumptions can be re-used many times before canceled. ◮ Cancelation of assumptions: only when the rules allow it, but not an obligation. ◮ All open assumptions at the end of the derivation must be declared. NB: the fewer (or, weaker) are the assumptions, the stronger is the claim of the derivation. Goranko
ND rules for the propositional connectives Introduction rules: Elimination rules: Goranko
ND rules for the propositional connectives Introduction rules: Elimination rules: A , B ( ∧ I ) A ∧ B Goranko
ND rules for the propositional connectives Introduction rules: Elimination rules: A ∧ B A ∧ B A , B ( ∧ E ) ( ∧ I ) A B A ∧ B Goranko
ND rules for the propositional connectives Introduction rules: Elimination rules: A ∧ B A ∧ B A , B ( ∧ E ) ( ∧ I ) A B A ∧ B A B ( ∨ I ) A ∨ B A ∨ B Goranko
ND rules for the propositional connectives Introduction rules: Elimination rules: A ∧ B A ∧ B A , B ( ∧ E ) ( ∧ I ) A B A ∧ B A B ( ∨ I ) [ A ] [ B ] A ∨ B A ∨ B . . . . . . A ∨ B C C ( ∨ E ) C Goranko
Introduction rules: Elimination rules: Goranko
Introduction rules: Elimination rules: [ A ] . . . B ( → I ) A → B Goranko
Introduction rules: Elimination rules: [ A ] A , A → B ( → E ) . . B . B ( → I ) A → B Goranko
Introduction rules: Elimination rules: [ A ] A , A → B ( → E ) . . B . B ( → I ) A → B [ A ] . . . ⊥ ( ¬ I ) ¬ A Goranko
Introduction rules: Elimination rules: [ A ] A , A → B ( → E ) . . B . B ( → I ) A → B A , ¬ A ( ¬ E ) ⊥ [ A ] . . . ⊥ ( ¬ I ) ¬ A Goranko
Two more ND rules Ex falso quodlibet: Reductio ad absurdum: Goranko
Two more ND rules Ex falso quodlibet: Reductio ad absurdum: ⊥ ( ⊥ ) A Goranko
Two more ND rules Ex falso quodlibet: Reductio ad absurdum: [ ¬ A ] ⊥ ( ⊥ ) . . . A ⊥ ( RA ) A Goranko
Propositional Natural Deduction: Example 1 Goranko
Propositional Natural Deduction: Example 1 A ∧ B ⊢ ND B ∧ A : Goranko
Propositional Natural Deduction: Example 1 A ∧ B ⊢ ND B ∧ A : A ∧ B Goranko
Propositional Natural Deduction: Example 1 A ∧ B ⊢ ND B ∧ A : ( ∧ E ) A ∧ B B Goranko
Propositional Natural Deduction: Example 1 A ∧ B ⊢ ND B ∧ A : ( ∧ E ) A ∧ B A ∧ B B Goranko
Propositional Natural Deduction: Example 1 A ∧ B ⊢ ND B ∧ A : ( ∧ E ) A ∧ B ( ∧ E ) A ∧ B B A Goranko
Propositional Natural Deduction: Example 1 A ∧ B ⊢ ND B ∧ A : ( ∧ E ) A ∧ B ( ∧ E ) A ∧ B B A ( ∧ I ) B ∧ A Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : A Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : A ¬ A Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : A ¬ A ( ¬ E ) ⊥ Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : A ¬ A ( ¬ E ) ⊥ ( ¬ I ) ¬¬ A Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : [ ¬ A ] 1 A ( ¬ E ) ⊥ ( ¬ I ) 1 ¬¬ A Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : [ ¬ A ] 1 A ( ¬ E ) ⊥ ( ¬ I ) 1 ¬¬ A ( → I ) A → ¬¬ A Goranko
Propositional Natural Deduction: Examples 2 ⊢ ND A → ¬¬ A : ( ¬ E ) [ A ] 2 , [ ¬ A ] 1 ⊥ ( ¬ I ) 1 ¬¬ A ( → I ) 2 A → ¬¬ A Goranko
Exercise: ⊢ ND ¬¬ A → A Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : A → B Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : A , A → B Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : A , A → B B Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : A , A → B , ¬ B B Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : A , A → B , ¬ B B ⊥ Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : [ A ] 1 , A → B , ¬ B B ⊥ 1 ¬ A Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : [ A ] 1 , A → B , [ ¬ B ] 2 B ⊥ 1 ¬ A 2 ¬ B → ¬ A Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : [ A ] 1 , A → B , [ ¬ B ] 2 B ⊥ 1 ¬ A 2 ¬ B → ¬ A ¬ B → ¬ A ⊢ ND A → B : Goranko
Propositional Natural Deduction: Examples 3 A → B ⊢ ND ¬ B → ¬ A : [ A ] 1 , A → B , [ ¬ B ] 2 B ⊥ 1 ¬ A 2 ¬ B → ¬ A ¬ B → ¬ A ⊢ ND A → B : [ ¬ B ] 1 , ¬ B → ¬ A , [ A ] 2 [ ¬ A ] ⊥ 1 B ( → I ) 2 A → B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : A ∨ B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : A A ∨ B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : ¬ A , A A ∨ B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : ¬ A , A ⊥ A ∨ B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : ¬ A , A ⊥ B A ∨ B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : [ ¬ A ] 1 , A ⊥ B 1 A ∨ B ¬ A → B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : [ ¬ A ] 1 , A ⊥ B B 1 A ∨ B ¬ A → B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : [ ¬ A ] 1 , A ⊥ B ¬ A B 1 A ∨ B ¬ A → B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : [ ¬ A ] 1 , A ⊥ [ ¬ A ] 2 , B B 1 2 A ∨ B ¬ A → B ¬ A → B Goranko
Propositional Natural Deduction: Examples 4 A ∨ B ⊢ ND ¬ A → B : [ ¬ A ] 1 , [ A ] 3 ⊥ [ ¬ A ] 2 , [ B ] 3 B 1 2 A ∨ B ¬ A → B ¬ A → B 3 ¬ A → B Goranko
Propositional Natural Deduction: Examples 5 Goranko
Propositional Natural Deduction: Examples 5 ⊢ ND ( A → ( B → C )) → (( A ∧ B ) → C ) : Goranko
Recommend
More recommend