Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
166 views

Propositional Logic Rules

This document lists 10 basic rules of inference for propositional logic, including negation introduction, conditional introduction, conjunction introduction, and disjunction elimination. It also lists important derived rules like modus tollens, hypothetical syllogism, and disjunctive syllogism. Finally, it provides common equivalences in propositional logic, such as De Morgan's laws, distribution, double negation, and material implication.

Uploaded by

annierana
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
166 views

Propositional Logic Rules

This document lists 10 basic rules of inference for propositional logic, including negation introduction, conditional introduction, conjunction introduction, and disjunction elimination. It also lists important derived rules like modus tollens, hypothetical syllogism, and disjunctive syllogism. Finally, it provides common equivalences in propositional logic, such as De Morgan's laws, distribution, double negation, and material implication.

Uploaded by

annierana
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

TEN BASIC RULES OF INFERENCE

Negation Introduction (~I indirect proof IP)


Assume p
Get q & ~q
~p
Negation Elimination (~E version of DN)
~~p p
Conditional Introduction (I conditional proof CP)
Assume p
Get q
p q
Conditional Elimination (E modus ponens MP)
p q
p
q
Conjunction Introduction (&I conjunction CONJ)
p
q
p & q
Conjunction Elimination (&E simplification SIMP)
p & q
p
Disjunction Introduction (vI addition ADD)
p
p v q
Disjunction Elimination (vE version of CD)
p v q
p r
q r
r
Biconditional Introduction (I version of ME)
p q
q p
p q
Biconditional Elimination (E version of ME)
p q
p q
or
q p




IMPORTANT DERIVED RULES OF INFERENCE

Modus Tollens (MT)
p q
~q
~P
Hypothetical Syllogism (HS)
p q
q r
p r
Disjunctive Syllogism (DS)
p v q
~p
q
Absorption (ABS)
p q
p (p & q)
Constructive Dilemma (CD)
p v q
p r
q s
r v s
Repeat (RE)
p
p
Contradiction (CON)
p
~p
Any wff
Theorem Introduction (TI)
Introduce any tautology, e.g., ~(P & ~P)


EQUIVALENCES

De Morgans Law (DM)
~(p & q) (~p v ~q)
~(p v q) (~p & ~q)
Commutation (COM)
(p v q) (q v p)
(p & q) (q & p)
Association (ASSOC)
[p v (q v r)] [(p v q) v r]
[p & (q & r)] [(p & q) & r]
Distribution (DIST)
[p & (q v r)] [(p & q) v (p & r)]
[p v (q & r)] [(p v q) & (p v r)]
Double Negation (DN)
p ~~p
Transposition (TRANS)
(p q) (~q~p)
Material implication (MI)
(p q) (~p v q)
Material Equivalence (ME)
(p q) [(p & q ) v (~p & ~q)]
(p q) [(p q ) & (q p)]
Exportation (EXP)
[(p & q) r] [p (q r)]
Tautology (TAUT)
p (p & p)
p (p v p)
Conditional-Biconditional Refutation Tree Rules
~(p q) (p & ~q)
~(p q) [(p & ~q) v (~p & q)]

You might also like