Scribd
Upload
191 views45 pages

Mathematical Logic

This document discusses mathematical logic and introduces key concepts including: 1. Statements can be sentences, equations, or inequations and can be either true or false but not both. 2. Logical connectives like "and", "or", "not" are used to connect statements. 3. Truth tables are used to determine the truth value of compound statements formed using logical connectives. 4. Quantifiers like "for all" and "there exists" are used to express statements about sets. Negation of statements containing quantifiers follows specific rules. 5. Validity of arguments is determined by checking if the conclusion is true whenever the premises are true using truth tables. Counter

Uploaded by

Rye Felimon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
191 views45 pages

Mathematical Logic

This document discusses mathematical logic and introduces key concepts including: 1. Statements can be sentences, equations, or inequations and can be either true or false but not both. 2. Logical connectives like "and", "or", "not" are used to connect statements. 3. Truth tables are used to determine the truth value of compound statements formed using logical connectives. 4. Quantifiers like "for all" and "there exists" are used to express statements about sets. Negation of statements containing quantifiers follows specific rules. 5. Validity of arguments is determined by checking if the conclusion is true whenever the premises are true using truth tables. Counter

Uploaded by

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

MATHEMATICAL LOGIC

Statement
1 . Statements may be sentences ( or ) equations ( or )

inequations ( or ) identities.
2 . A statement may be true or false , but not both

at the same time.


3 . The opposite of false is true and opposite of

true is false.
Logical Connectives
Truth Table
Truth Table
Let p be “ He is tall ” and q be “ He is handsome ” . Write
each of the following statements in symbolic form using p and
q and find its truth value by using table.
( i ) He is tall but not handsome.
( ii ) It is false that he is short or handsome
( iii ) He is neither tall nor handsome
( iv ) He is tall, or he is short and handsome
( v ) It is trute that he is short or not handsome
Determine the truth value of each of the following composite
statements.
( i ) If 3 + 2 = 7, then 4+4 =8
p : 3 + 2 = 7, q : 4+4 =8
( ii ) It is not true that 2 + 2 = 5, if and only if 4+4 =10
p : 2 + 2 = 5, q : 4+4 =10

( iii ) Yangon is in India or Tokyo is in Myanmar

p : Yangon is in India , q : Tokyo is in Myanmar


( iv ) It is not true that 1 + 1 = 3 or 2 +1 = 3
p : 1 + 2 = 3, q : 2+1=3

( v ) It is false that if Yangon is in Japan then Paris is in


Myanmar
p : Yangon is in Japan , q : Paris is in Myanmar
Propostion and Truth Table
Logical Equivalence
Two propositions P ( p , q , r ,... ) and Q ( p , q , r ,.... ) are
said to be logically equivalent if their truth tables are indentical.
We denote this by
By the * columns, they are equivalent
By the * columns, they are equivalent
Validity of Argument
A statement that a set of propositions P1, P2 , P3 ,..... , Pn
yields another proposition P is called an argument on
propositions.
The propositions P1, P2 , P3 ,..... , Pn are called premises
and the proposition P is called concusion.
Argument form is shown as follows;
Since an argument is also a statement it has a true value.
An argument on propositions is said to be valid if the
conclusion P is the true whenver the premises P1, P2 , P3 ,..... , Pn
are true
Example:
If everyone does not have love, he is lonely. A person who fells
loneliness can early die. Therefore, if he has no love, he can
early die.
Let p be “ A person who does not have love ”
q be “ A person who is lonly ”
r be “ A person who can early die ”
By the 1st ,5th , 7th and 8th rows, this argument is valid.
Test the validity of the argument. If it rain, then Mg Mya will
be sick. It did not rain. Therefore Mg Mya was not sick.
Solution:
Let p be “ It rain ”
q be “ Mg Mya is sick ”
*

By the * row, the argument is not valid


By the * rows, the argument is valid
If Ma Aye gets married, then either Ma Hla is maid of honour
or Ma Mya maid of honour. If Ma Hla is maid of honour and
Ma Mya is maid of honour, then there will be a quarrel at the
wedding. Therefore if Ma Aye gets married, then there will be
quarrel at the wedding.
p : Ma Aye gets married
q : Ma Hla is maid of honour
r : Ma Mya maid of honour
s : there is a quarrel at the wedding
By the * row, the argument is not valid
Quantifiers
Universal Quantifier
Existential Quantifier

Negation of Proposition Which contain quantifiers


Let p ( x ) be a statement. The equivalent form of a
negation of a statement which contain quantifiers is given by
the following theorem.
Determine the truth value of each of the following. Here the
universal set U = R

Therefore it is false

Therefore it is true
Therefore it is true
Therefore it is false

Therefore it is true

Therefore it is false
Prove that the following statements are false. Here U = R = the
set of real numbers.

Therefore it is false Therefore it is false

Therefore it is false Therefore it is false

Therefore it is false
Find the counter example for each of the following statement
where A = { 2 , 3 , 4 , 5 , 6 , 7 ,8 , 9 }

Therefore this statement is false Therefore this statement is false

Therefore this statement is false


Therefore this statement is false

Therefore this statement is false


Negate each of the statement .
State the Pythagoras Theorem with logical notations

Re-write the statement “ a divides b if and only if some


integer n, b = na ” by using logic notations.

You might also like