Scribd
Upload
50 views

THE Method of Deduction: By: Zane Azriel Natividad Francis Bea Lopez

The document discusses the method of deduction in logic. It outlines 9 rules of inference - modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, constructive dilemma, absorption, simplification, conjunction, and addition. It also outlines 10 rules of replacement - De Morgan's theorems, commutation, association, distribution, double negation, transposition, implication, exportation, and tautology. The method of deduction involves using these rules in a chain of valid arguments to prove the validity of a conclusion based on its premises.

Uploaded by

Sherie Mae Ojendras
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views

THE Method of Deduction: By: Zane Azriel Natividad Francis Bea Lopez

The document discusses the method of deduction in logic. It outlines 9 rules of inference - modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, constructive dilemma, absorption, simplification, conjunction, and addition. It also outlines 10 rules of replacement - De Morgan's theorems, commutation, association, distribution, double negation, transposition, implication, exportation, and tautology. The method of deduction involves using these rules in a chain of valid arguments to prove the validity of a conclusion based on its premises.

Uploaded by

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

THE

METHOD OF
DEDUCTION
BY: ZANE AZRIEL NATIVIDAD
FRANCIS BEA LOPEZ
RULES OF INFERENCE
ELEMENTARY VALID
ARGUMENT
• Elementary valid argument forms whose substitution
instances may be used to justify the steps in a formal proof
of the validity of a more complex deductive argument. The
rules of inference that we employ here include:
1.Modus Ponens,
2.Modus Tollens,
3.Hypothetical Syllogism,
4.Disjunctive Syllogism,
5.Constructive Dilemma,
6.Absorption,
7.Simplification,
8.Conjunction, and
9.Addition.
MODUS PONENS (M.P.)

A rule of inference of the form:


p⊃q
p
_____
q
Example: "If Monday is the 14th, then Thursday must be the
17th. Monday is the 14th. Therefore, Thursday is the 17th."
MODUS
TOLLENS (M.T.)
A rule of inference of the form:
p⊃q
~q
_______
~p
Example: "If the snow fall this morning, then the temperature
would still be low. But the temperature is not low. Therefore, it did
not snow this morning."
HYPOTHETICAL
SYLLOGISM (H.S.)
A rule of inference of the form:
p⊃q
q⊃r
_______
p⊃r
Example: "If Tristan is promoted, then Mark will be, too. But
if Mark is promoted, then Johnny will be angry. Therefore, if
Tristan is promoted, then Johnny will be angry."
DISJUNCTIVE
SYLLOGISM (D.S.)
A rule of inference of the form:
p∨q
~p
_____
q
Example: "Either Ella brought him to the party or Keith did. But
Ella didn't. So, Keith brought him to the party."
CONSTRUCTIVE
DILEMMA (C.D.)
A rule of inference of the form:
(p⊃q)•(r⊃s)
p∨r
_________________________
q∨s
Example: "If it's sunny tomorrow we'll have an outing, and if
it rains we'll go to the restaurant. But either it will be sunny or
it will rain tomorrow. Therefore, either we'll have an outing or
we'll go to the restaurant."
ABSORPTION (ABS.)
A rule of inference of the form:
p⊃q
______________
p⊃(p•q)
Example: "If Jess comes to the party, then so will Beth.
Therefore, if Jess comes to the party, then both Jess and
Beth will."
SIMPLIFICATION (SIMP.)
A rule of inference of the form:
p•q
_____
p
Example: “Katy is short and Katy is thin. Therefore, Katy is
short."
CONJUNCTION (CONJ.)
A rule of inference of the form:
p
q
_____
p•q
Example: "Kay has a dog. Alan has a dog. Therefore, both
Kay and Alan have a dog."
ADDITION (ADD.)
A rule of inference of the form:
p
_____
p∨q
Example: "It is raining. Therefore, either it is raining or the
sun is shining."
FORMAL PROOF OF
THE VALIDITY
• The basic notion underlying this new method is that since a
chain of interrelated arguments is valid so long as each of its
links is valid, we can demonstrate the validity of an argument
by starting with its premises, taking one tiny valid step at a
time, and finally reaching its conclusion.
• the validity of any argument depends solely upon its logical
form. An argument in the propositional calculus is valid
whenever it is a substitution-instance of an argument form in
which it is impossible for the premises to be true and the
conclusion false.
RULES OF REPLACEMENT
Tautologies that express the logical equivalence of pairs of elementary statement
forms, each of whose substitution instances may be used to replace those of the
other wherever they occur within a formal proof of the validity of a deductive
argument. The rules of replacement that we employ here include:
10.De Morgan's Theorems,
11.Commutation,
12.Association,
13.Distribution,
14.Double Negation,
15.Transposition,
16.Implication,
17.Equivalence,
18.Exportation, and
19.Tautology.
DE MORGAN'S
THEOREMS (DE M.)
A rule of replacement of the forms:

~(p•q)≡(~p∨~q)
~(p∨q)≡(~p•~q)

Example: "It is not the case that I am both thin and tall" is
equivalent to "Either I am not thin or I am not tall."
COMMUTATION (COMM.)
A rule of replacement of the forms:

(p∨q)≡(q∨p)
(p•q)≡(q•p)

Example: "Either Coffee is brown or Milk is white." is


equivalent to "Either Milk is white or Coffee is brown."
ASSOCIATION (ASSOC.)
A rule of replacement of the forms:

[p∨(q∨r)]≡[(p∨q)∨r]
[p•(q•r)]≡[(p•q)•r]

Example: “Ally is over 25, and so are Jane and Keller." is


equivalent to “Ally and Jane are over 25, and so is Keller."
DISTRIBUTION (DIST.)
A rule of replacement of the forms:

[p•(q∨r)]≡[(p•q)∨(p•r)]
[p∨(q•r)]≡[(p∨q)•(p∨r)]

Example: "Paul is thin, and so is either Susan or James." is


equivalent to "Either Paul and Susan are thin or Paul and
James are."
DOUBLE
NEGATION (D.N.)
A rule of replacement of the form:

p≡~~p

Example: “Gina is smart" is equivalent to "It is not the case


that Gina is not smart."
TRANSPOSITION (TRANS.)
A rule of replacement of the form:

(p⊃q)≡(~q⊃~p)

Example: "If it produces fruit, then it is right." is equivalent


to "If it isn't right, then it doesn't produce fruit."
IMPLICATION (IMPL.)
A rule of replacement of the form:

(p⊃q)≡(~p∨q)

Example: "If it rains, then we cancel the outing." is equivalent


to "Either it doesn't rain or we cancel the outing."
EXPORTATION (EXP.)
A rule of replacement of the form:

[(p•q)⊃r)]≡[p⊃(q⊃r)]

Example: "If Harry is short and quick, then he plays well." is


equivalent to "If Harry is short , then if he's quick, then he
plays well."
TAUTOLOGY (TAUT.)
A rule of replacement of the forms:

p≡(p∨p)p≡(p•p)

Example: "Paul is clever." is equivalent to "Paul is clever and


Paul is clever."
SOURCES:

http://www.philosophypages.com/dy/m9.htm#mp
http://www.philosophypages.com/lg/e11a.htm#add
http://www.philosophypages.com/lg/e10b.htm#val
http://www.philosophypages.com/dy/r9.htm#repl

You might also like