Logic: Mathematics Computer Science
Logic: Mathematics Computer Science
Logic: Mathematics Computer Science
on
LOGIC
for
MATHEMATICS
and
COMPUTER SCIENCE
(LMCS, p. 1)
I.2
(LMCS, p. 5)
ARISTOTLE (4th Century B.C.)
Invented Logic
Socrates is mortal.
I.3
(LMCS, p. 5)
I.4
All S is P.
universal affirmative
No S is P.
universal negative
Some S is P.
particular affirmative
Some S is not P.
particular negative
Mnemonic Device:
A ff I rmo
nEgO
I.5
Syllogisms
(Use P and M)
Minor Premiss
(Use S and M)
Conclusion
S P
I.6
I.7
Classification of Syllogisms
The mood XYZ of a syllogism is the AEIO
classification of the three statments in a
syllogism, where the first letter X refers to
the major premiss, etc.
For example the syllogism
All students are clever.
No clever people are lazy.
I.8
2nd Figure
M P
P M
S M
S M
S P
S P
3rd Figure
4th Figure
M P
P M
M S
M S
S P
S P
I.9
A
S
O
S
I.10
All M is P .
All S is M .
Some S is P .
I.11
All M is P .
All S is M .
Some S is P .
I.12
Some M is P .
Some M is S.
Some S is P .
S
or
P
M
(LMCS, p. 8)
I.13
Second figure
Third figure
Fourth figure
Conclusion
A
E
I
O
A
E
I
O
A
E
I
O
A
E
I
O
AAAA EEE E
AE I OAE I O
etc.
I.14
All S is P .
S P0 = 0
or just
SP 0 = 0.
No S is P .
SP = 0
or just
SP = 0.
All S is P.
becomes the equational argument
MP 0 = 0
SM 0 = 0
SP 0 = 0.
I.15
(LMCS, p. 1011)
I.16
SM 0 = 0
SP 0 = 0
is correct as
SP 0 = S1P 0
= S(M M 0)P 0
= SM P 0 SM 0P 0
= 00
= 0.
For equational arguments you can use the
fundamental identities.
(LMCS, p. 12)
I.17
Fundamental Identities
for the Calculus of Classes
1.
X X
idempotent
2.
X X
idempotent
3.
X Y
Y X
commutative
4.
X Y
Y X
commutative
5.
X (Y Z) =
(X Y ) Z
associative
6.
X (Y Z) =
(X Y ) Z
associative
7.
X (X Y ) =
absorption
8.
X (X Y ) =
absorption
(LMCS, p. 12)
I.18
9.
X (Y Z) =
(X Y ) (X Z)
distributive
10.
X (Y Z) =
(X Y ) (X Z)
distributive
11.
X X0 =
12.
X X0 =
13.
X 00 =
14.
X 1 =
15.
X 1 =
16.
X 0 =
17.
X 0 =
18.
(X Y )0 =
X0 Y 0
De Morgans law
19.
(X Y )0 =
X0 Y 0
De Morgans law.
(LMCS, p. 13)
I.19
F (B1, . . . , Bn) = 0.
Booles work marks the end of the focus on
Aristotles syllogisms, and the beginning of
Mathematical Logic.
(LMCS)
Chapter 1 of LMCS gives four different
methods for analyzing such equational
arguments:
Fundamental Identities
for algebraic manipulations
Venn Diagrams
The Elimination Method of Boole
The Tree Method of Lewis Carroll
I.20
(LMCS, p. 21)
I.21
A
ABC
Venn Diagrams
ABC
A BC
is not a Venn
A
diagram.
(LMCS, p. 22)
I.22
Two Classes
Four Classes
Three Classes
Five Classes
(LMCS, p. 22)
I.23
This
(LMCS, p. 22)
I.24
Edwards Construction for 6 Regions
Draw the
perpendicular lines
and the circle first.
Then follow the
circle with: (4) the
blue region, (5) the
red region, and (6)
the green region.
Join the endpoints of
the perpendicular
lines to make closed
regions.
This
(LMCS, p. 22)
I.25
(LMCS)
I.26
and
AC 0 = 0.
as
(LMCS, p. 25)
I.27
Example
Given
(AC B)(AB 0 C 0) = 0,
and
BC 0 = 0
I.28
Thus
F (A, B) = AB AB 0 A0B 0.
I.29
(LMCS, p. 26)
I.30
(LMCS, p. 26)
I.31
Example
The two premisses
A(B 0C)0 = 0
(A B)C 0 = 0
become
A(B 0C)0
(A B)C 0
= 0.
(LMCS, p. 26)
I.32
(LMCS)
I.33
Example
Find the most general conclusion involving
only P and S that follows from
P Q0 = 0
QR0 = 0
RS 0 = 0
(LMCS, p. 17,18)
I.34
F = 0
FX = 0
reduces to showing
and
F X0 = 0
since
F = F X F X 0.
(LMCS, p. 17,18)
I.35
Example
1. P Q0 = 0
To show that
is valid:
2. QR0 = 0
3. RS 0 = 0
P S0 = 0
PS
Q
R
3
Q
R
I.36
or
are dynamic .
ABCD 0 = 0.
Etc.
or
A0M L0 = 0.
(LMCS)
I.37
A Naive Approach to
1.
4.
7.
10.
ABCD 0 = 0
GM C 0 = 0
M I 0J 0 = 0
H 0 F L0 = 0
A 0 M L0 = 0
B 0F H = 0
HM K 0 = 0
M LF = 0
2.
5.
8.
11.
3.
6.
9.
12.
F ED = 0
D 0 BEG0 = 0
KJL0 E 0 = 0
KIAE 0 = 0
MF = 0
MF
A
B
C
D
E
G G
B
C
B
C
ETC.
(LMCS, p. 18)
A Smart Approach
1. ABCD 0 = 0 2.
4. GM C 0 = 0 5.
7. M I 0J 0 = 0
8.
10. H 0F L0 = 0 11.
MF = 0
I.38
A 0 M L0 = 0
B 0F H = 0
HM K 0 = 0
M LF = 0
3.
6.
9.
12.
MF
L
11
10
K
E
E
D
12
1
4
J
7
F ED = 0
D 0BEG0 = 0
KJL0E 0 = 0
KIAE 0 = 0