Pure Math
Sept .
18 2024
.
Logic and
Reasoning
Negation
Is the opposite truth value of its
input statement.
Let
a be a preposition :
> The of represented read "not a "
negation by -9
-
in and is as
a
Truth Table for (2)
negation
!- I
p -
P
19
The main connectivesore negations , conjunction , disjunction implications,
,
biconditionals .
Connectives
Conjunction (AND) :
Any two statements can be
joined by the word" and "to make a conjoined
Statement :
If the proposition p and q are connected to form a compound
"and"
statement
by the connective ,
it is represented symbolically "prq".
The truth table for Conjunction (AND) is as follows :
PqP,
pap19
OR 111
TFF & 00
F 010
Eff
T
G 00
# AND (1) :
The true if if both
statement is
only and
only
inputs are true.
Disjunction (OR) :
The proposition p and
a are called disjunction if the connective of the
statement is connected
by "or". The
symbol for the OR connective is
"pVq"
Morgan's
B e Law
Any two corpord statements are
logically equivalent
if
they
posses the same truth value.
eg1 .
Pove that- (png) is the same as
-qP1q-(PA)
Puna"
I
pa
+ F F TF F
I F F T F T ↑
F F T
I
T i
T + + +
Hence , (PMI) ~ por-a
-ndition
ates
as implication These. are statement of the form
"p implies q where
pand a are propositions .
The
symbol for "p implies q' are
p-q
or 'q implies are p
.
For p-g called the conclusion false if true (the
, p is .
Peg is
only p is
hypothesis) and g is false (the conclusion) .
The following is the truth table for conditional or
implication .
statement
: q
per
=
tapositive
~ ,
Enverse or Converse Implications
Contrapositive Implications :
The
contrapositive of the implication "p-q" is where we switch
individually
around the proposition and
negate (not) then
.
The following is the truth table for a
contrapositive implication :
P q
-
p -
q-q - -p
I
T T
Converse Implication :
The of the implication "ptq"
converse is
simply switching
preposition
"
the around , hence , 9+ p"
a
Inverse Implication :
The inverse of the implication "p-q" is just to
negate
the proposition individually (do not switch then around) .
·&
&
Biconditional Statement :
The biconditional statement the
is
simply using
state twice "pzq"
implication
The statement "if the calculator is
working ,
then I will solve
"
the
problem ,
and if I solve the problem ,
the calculator is
working
S
I
Pa If the
P *
'hypothesis
true and the
E
is conclusion
I F is False then it is
,
False THIS IS THE ONLY
.
TIME IT IS FAISE
Draw the truth table of the
following to state if
they are
logically equivalent
~ (pVq) is the same up nug : Hence they are
logically
equivalent .
⑧-pvq is the same as ~(pnq) :. Here
they are
logically
woequivalentquivalent
⑧ pu(gar) is the same as (pug) 1(pur) :. Here
they are
logically equivalent
① (p-q)d(q + p) is the same as
peq
: Here
they are logically
equivale
~
1)
↑
3)
a
r & dr Pre pur Pulan) (Preid/ovi)
↑ T
I
+ + T T
T F + TT T
T F + F + T T T
+ FFF + T + T
F + T + T + + +
f + FF T F F F
F F
ffff
FT F T
F F
↑
Tautology and Contradiction
Tautology
Is true.
always
compound that is
a
proposition
T
eg purp
=
.
Contradiction
A
compound proposition that false .
is
always
Pamp F
eg
=
.
A
contingency is a compound proposition that is neither a
contradiction
tautology or
Tantology ·
Contradiction
I -o
F
E l