0% found this document useful (0 votes)
5 views

Maths

Uploaded by

arunadevy
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
0% found this document useful (0 votes)
5 views

Maths

Uploaded by

arunadevy
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/ 13

ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

1. 1. Proportional Logic

Proposition:

A proposition (or statement) is a declarative sentence which is either true or false

but not both.

Notations:

If a proposition is true then it’s truth value is denoted by T.

If a proposition is false then it’s truth value is denoted by F.

P, Q, R, S, . . . are used to denote propositions.

Connectives:

Connective is an operation which is used to connect two or more than two

statements. Simply it is called sentential connectives. It is also known as Logical

Connectives or Logical Operators.

Compound Statement:

Statements which contain one or more primary statements and some connectives

are called compound or molecular or composite statements.

Example:

Let 𝑝: 5 + 10 = 20 be the statement

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

¬𝑝: It is false that 5 + 10 = 20

Hence ¬𝑝 is a compound statement with primary statement as p and connective as

¬𝑝

Five Basic Connectives

Logical Name Symbols Type of

Connectives Operator

1 Not Negation ¬ Unary

2 And Conjunction ∧ Binary

3 Or Disjunction ∨ Binary

4 If . . . then Conditional (or) Implication → Binary

5 If and only if (iff) Biconditional ⟷ (𝑜𝑟) ⇌ Binary

Statement Formula:

A statement formula is an expression which is a string consisting of variables

(capital letters with or without subscripts), parenthesis and connective symbols.

Truth Tables:

The truth value of proposition is either true (T) or false (F).

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

A truth table is a table that shows the truth value of a compound proposition for all

possible cases.

Negation:

If a statement is TRUE, then its negation is FALSE. (And if a statement is

FALSE, then its negation is TRUE).

P ¬𝐩

T F

F T

Conjunction:

A conjunction is a compound statement formed by joining two statements with the

connector AND. The conjunction “𝑝 and 𝑞” is symbolized by p, q.

P Q 𝑃∧𝑄

T T T

T F F

F T F

F F F

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

Disjunction:

A conjunction is a compound statement formed by joining two statements with the

connector OR. The disjunction “p or q” is symbolized by p, q. A disjunction is

FALSE if and only if (iff) both statements are FALSE; otherwise it is TRUE.

P Q 𝑃∨𝑄

T T T

T F T

F T T

F F F

Conditional:

A conditional statement, symbolized by 𝑝 → 𝑞 is an if – then statement in which p

is a hypothesis and q is a conclusion. The logical connector in a conditional

statement is denoted by the symbol. The conditional is defined to be TRUE unless

a TRUE hypothesis leads to a FALSE conclusion.

P Q 𝑃→𝑄

T T T

T F F

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

F T T

F F T

Bi conditional:

A bi -conditional statement is defined to be TRUE whenever both parts have the

same truth value. The bi-conditional operator is denoted by a double – headed

arrow. The bi-conditional p↔ q represents “p if and only if”, where p is a

hypothesis and q is a conclusion.

P Q 𝑃⟷𝑄

T T T

T F F

F T F

F F T

Problems under logical connectives

1.Write the following statements in symbolic form, “If either S.Pavithra takes

calculus or S. Sharnika takes sociology, then Malathy will take English.

Solution:

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

P: S.Pavithra takes calculus.

Q: S.Sharnika takes sociology.

R: Malathy takes English.

∴ The logical expression is (P ∨ Q) → R

2. S. Pavithra can accesses the internet from campus only if she is a computer

science major or she is not a fresh girl.

Solution:

P: S. Pavithra can accesses the internet from campus.

Q: S. Pavithra is a computer science major.

R: S. Pavithra is a fresh girl.

¬P: S. Pavithra is not a fresh girl.

∴ The logical expression is P → (Q ∨ ¬R)

3. How can this English sentence be translated into logical expression.

“You can access the internet from campus only if you are computer science

major or you are not a freshman”.

Solution:

P: You can access the internet from campus.

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

Q: You are computer science major.

R: You are a freshman.

¬R: you are not a freshman.

∴ The logical expression is P → (Q ∨ ¬R)

4. Write the logical expression for “If tigers have wings then the earth travels

round the sun.”

Solution:

P: Tigers have wings. (F)

Q: Earth travels round the sun. (F)

The logical expression is P → Q (T)

5. Construct the truth table for a)¬ (P ∧ Q) and b) (¬P) ∨ (¬Q)

Solution:

To prove ¬ (P ∧ Q) and (¬P) ∨ (¬Q)

P Q (P ∧ Q) ¬ (P ∧ Q)

T T T F

T F F T

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

F T F T

F F F T

P Q ¬P ¬Q (¬P) ∨ (¬Q)

T T F F F

T F F T T

F T T F T

F F T T T

6. Construct the truth table for (P ∨ Q) ∨ ¬Q.

Solution:

P Q P∨Q ¬Q (P ∨ Q) ∨ ¬Q.

T T T F T

T F T T T

F T T F T

F F F T T

7. Construct the truth table for ¬(¬𝑷 ∨ ¬Q).

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

Solution:

P Q ¬P ¬Q ¬𝑃 ∨ ¬Q ¬(¬𝑃 ∨ ¬Q)

T T F F F T

T F F T T F

F T T F T F

F F T T T F

8. Construct the truth table for S: (P∧Q) ∨ (¬P∧Q) ∨ (P∧ ¬Q)

Solution:

P Q P ∧ Q ¬P ¬Q ¬P∧Q P∧ ¬Q (¬P∧Q) ∨ (P∧ ¬Q) S

T T T F F F F F T

T F F F T F T T T

F T F T F T F T T

F F F T T F F F F

9. Construct the truth table for i) R: ¬(¬𝑷 ∨ ¬Q). ii) ¬(¬𝑷 ∧ ¬Q).

Solution:

P Q ¬P ¬Q ¬𝑃 ∨ ¬Q ¬𝑃 ∧ ¬Q R S

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

T T F F F F T T

T F F T T F F T

F T T F T F F T

F F T T T T F F

10. Construct the truth table for (P →Q) ∧ (Q→ P).

Solution:

P Q P →Q Q→ P (P →Q) ∧ (Q→ P)

T T T T T

T F F T F

F T T F F

F F T T T

Tautology:

A Tautology is a statement that is always TRUE, no matter what. If you construct a

truth table for a statement and all the column values for the statement are TRUE,

then the statement is a Tautology because it’s always TRUE.

Contradiction:

A statement that is always FALSE is known as a Contradiction.

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

i.e, The last column values contains all FALSE values.

Results:

Tautology Contradiction

In the result column all the entries are T In the result column all the entries are F

T F

T F

T F

T F

Problems under Tautology and contradiction

1.Show that the proposition P ∨ ¬ (P ∧ Q) is a tautology.

Solution:

P Q P∧Q ¬ (P ∧ Q) P ∨ ¬ (P ∧ Q)

T T T F T

T F F T T

F T F T T

F F F T T

2.Show that (Q ∨ (P∧ ¬Q)) ∨ (¬P ∧ ¬Q) is a tautology.

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

Solution:

Let S = (Q ∨ (P∧ ¬Q)) ∨ (¬P ∧ ¬Q)

P Q ¬P ¬Q P∧ ¬Q ¬P ∧ ¬Q Q ∨ (P∧ ¬Q) S

T T F F F F T T

T F F T T F T T

F T T F F F T T

F F T T F T F T

3. Show that ¬P → (P →Q) is a tautology.

Solution:

P Q ¬P P →Q ¬P → (P →Q)

T T F T T

T F F F T

F T T T T

F F T T T

4. Show that (P ∧ Q) ∧ ¬ (P ∨ Q) is a contradiction.

Solution:

MA8351 DISCRETE MATHEMATICS


ROHINI COLLEGE OF ENGINEERINGAND TECHNOLOGY

P Q P∧Q P∨Q ¬ (P ∨ Q) (P ∧ Q) ∧ ¬ (P ∨ Q)

T T T T F F

T F F T F F

F T F T F F

F F F F T F

MA8351 DISCRETE MATHEMATICS

You might also like