Scribd
Upload
2K views2 pages

9 Rules of Inference 10 Rules of Replacement Symbols in Logic

1.) The document outlines 9 rules of inference and 10 rules of replacement used in logic. The rules of inference include modus ponens, modus tollens, disjunctive syllogism, and hypothetical syllogism. The rules of replacement include de Morgan's theorem, distribution, double negation, and material implication. 2.) It also defines the symbols used in logic, including the symbol for negation (~), conjunction (∧), disjunction (v), conditional (→), and biconditional (≡). 3.) Truth tables are provided for conjunction, disjunction, conditional, and biconditional connectives.

Uploaded by

Jonathan Chan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2K views2 pages

9 Rules of Inference 10 Rules of Replacement Symbols in Logic

1.) The document outlines 9 rules of inference and 10 rules of replacement used in logic. The rules of inference include modus ponens, modus tollens, disjunctive syllogism, and hypothetical syllogism. The rules of replacement include de Morgan's theorem, distribution, double negation, and material implication. 2.) It also defines the symbols used in logic, including the symbol for negation (~), conjunction (∧), disjunction (v), conditional (→), and biconditional (≡). 3.) Truth tables are provided for conjunction, disjunction, conditional, and biconditional connectives.

Uploaded by

Jonathan Chan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

9 Rules of Inference 10 Rules of Replacement Symbols in Logic

1.) Modus Ponens (MP) 1.) de Morgan’s Theorem (dMT) 1.) Tilde
pq ~(p  q) ~(p v q) (not) ~
p ~p v ~q ~p  ~q
∴q
2.) Conjunction
2.) Modus Tollens (MT) 2.) Commutative (Comm) (and) 

pq p q
qp p  q
~q 1 1 1
∴~p 1 0 0
3.) Association (Assoc) 0 0 1
3.) Disjunctive Syllogism (DS) p  (q  r) 0 0 0
pvq or pvq (p  q)  r
~p ~q
∴q ∴p 3.) Disjunction
4.) Distribution (Dist.) (either/or) v
4.) Hypothetical Syllogism (HS) p  (q v r) p v (q  r)
pq (p  q) v (p  q) (p v q)  (p v r) p v q
qr 1 1 1
1 1 0
∴pr 0 1 1
5.) Double Negation (DN)
~~p 0 0 0
5.) Constructive Dilemma (CD)
(pq)  (rs) p
pvr 4.) Conditional Connective
q v s (if-then) 
6.) Transposition (Trans)
pq
6.) Absorption (Abs) p  q
~q  ~p
pq 1 1 1
1 0 1
p(p  q) 7.) Material Implication (Imp) 0 1 1
pq 0 1 0
7.) Addition (Add) ~p v q
p -Antecedent -Consequence
-Sufficient -Necessary
p v q 8.) Material Equivalence (Equiv) Condition Condition
p≡q
8.) Simplification (Simp) (pq) (qp)
p q (p q) v (~p ~q) 5.) Biconditional
(iff) ≡
p
9.) Exportation (Exp) p ≡ q
9.) Conjunction (Conj) (p  q)  r 1 1 1
p p(qr) 1 0 0
q 0 0 1
0 1 0
p  q
10.) Tautology (Taut)
p p p v p
p p

You might also like