Logic-Argument.References

Logic-Argument.References - Deductions in Modal Logic...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Deductions in Modal Logic Introduction Before Kripke came up with a decent semantics for modal logics we were forced to deal with them only using the tools of proof-theory. We'll be looking at how this is done in the next two lectures. We'll begin by looking at proofs using natural deduction. Natural Deduction Standard Rules We'll assume that we have most of the rules that were introduced in the introductory logic course. Replacement rules: ~~p : : p ( DN ) Double Negation p v q : : q v p ( Com ) v Commutation p & q : : q & p ( Com ) & Commutation p v (q v r) : : (p v q) v r ( Assoc ) v Association p & (q & r) : : (p & q) & r ( Assoc ) & Association p v (q & r) : : (p v q) & (p v r) ( Dist ) v Distribution p & (q v r) : : (p & q) v (p & r) ( Dist ) & Distribution ~(p & q) : : ~p v ~q ( DeM ) DeMorgans Law ~(p v q) : : ~p & ~q ( DeM ) DeMorgans Law p v p : : p ( Idem ) v Idempotence p & p : : p ( Idem ) & Idempotence p q : : ~p v q ( IMP ) Material Implication p q : : ~q ~p ( Cont ) Contraposition (p & q) r : : p (q r) ( Exp ) Exportation p (q r) : : q (p r) ( Perm ) Permutation p q : : (p q) & (q p) ( Equiv ) Equivalence p q : : (p & q) v (~p & ~q) ( Equiv ) Equivalence p : : p & (q v ~q) ( TConj ) Tautologous Conjunct p : : p v (q & ~q) ( TConj ) Contradictory Disjunct Inference rules: p & q ( Simp ) Simplification p p ( Conj ) Conjunction ... Non-Classical Logics http://www.uq.edu.au/~uqswats2/courses/phil2100/... 1 of 9 06/17/2008 12:00 AM q p & q p q ( MP ) Modus Ponens, or p ( AA ) Affirming the Antecedent q p q ( MT ) Modus Tollens, or ~q ( DC ) Denying the Consequent ~p p q ( HS ) Hypothetical Syllogism, or q r ( ChArg ) Chain Argument p r p v q ( DS ) Disjunctive Syllogism, or ~p ( DC ) Denying a Disjunt q p ( Add ) Addition, or p v q ( DA ) Disjunctive Addition p v r ( CD ) Constructive Dilemma p q r s q v s p ( CP ) Conditional Proof ... q p q ~p ( RAA ) Reductio ad Absurdum ... q & ~q p Modal Rules Replacement rules: ~<>~p : : p ~~p : : <>p ~p : : <>~p ~<>p : : ~p Inference rules: p ( NE ) Necessity Elimination Non-Classical Logics http://www.uq.edu.au/~uqswats2/courses/phil2100/... 2 of 9 06/17/2008 12:00 AM p p ( PI ) Possibility Introduction <>p p ( MRT ) Modal Reiteration T p p ( MRT ) Modal Reiteration S4 p <>p ( MRT ) Modal Reiteration S5 <>p _______ ( NI ) Necessity Introduction ... p p The NI rule is an application of a null assumption deduction, which is like a CP but with no initial assumption to be discharged at the end. Since there are no assumptions, and the result is proved, the idea is that the consequence must be a necessary truth - it doesn't depend on any contingencies....
View Full Document

This note was uploaded on 06/16/2008 for the course PHI 250 taught by Professor Bykova during the Fall '07 term at N.C. State.

Page1 / 9

Logic-Argument.References - Deductions in Modal Logic...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online