Government Engineering College Gandhinagar Group G1

Government Engineering
College Gandhinagar
Group G1
Parekh Moxa S. 180130107050

Mehta Simoni A. 180130107037
Parmar Mittal J. 180130107054
Maths Presentation
 Logic
Logic is analysis of language, which consists of signs. Logic is a set of rules (or
axioms) which we can use to draw valid conclusions.
 Statements (or Propositions)

Statements are kinds of sentences which we have to use to convey our
thoughts to others. A sentence is a statement or proposition if it is possible
to say what is conveyed by the sentence is true or false.
i.e. A sentence of which it is meaningful, to say, whether it is true or false

but not both is called a statement or proposition.
We denote statements by letters p, q, r, s......

Examples:-
1. Pune is capital of India.

2. Mars is a planet.
3. 9 > 13.
4. y + 8 = 12
5. 6 {1, 2, 3, 4}
6. X A
7. There are 12 months in a year.
 Examples 2 and 7 are true statements.

 Examples 1, 3, 5 are false statements. In example 4, if we write 4 in place of y it
becomes a true sentence and if y is not 4 then it is a false sentence. Similarly in 6
we cannot say whether this sentence is true or not unless we are told what are the
elements of A.

 Thus only those sentences are statements about which we can say whether these
are true or false.
Definition:-
1) A statement is a declarative sentence with a definite truth value.
2) Hence 1, 2, 3, 5, 7 are statements.
3) 4 is not a statement since its truth value depends on the value of y. If y is 4

the sentence is true, if y 4 then the sentence is false.
4) Also 6 is not a statement since its truth value depends on set A, if

A = {x , y , z , w} then 6 is true but if A = {1, 2, 3, 4} then 6 is false.
 Open Statement
In example 4 above if we put y= 4 it becomes a true statement , if we take
value of y 4 , it becomes false. Such statements are open statements, Thus if a
mathematical sentence is neither true nor false it is called open sentence.
 Definition:-
An open statement is a sentence that contains one or more variables such that
when certain values are substituted for the variables, we get statements.

Examples:-
1. x + 7 = 9
2. 3x + 2 > 8
3. x A
 Truth Value of a Statement
Statement has a definite truth value which is either true or false. True
values are denoted by (T) and false values are denoted by (F).
 Truth Table
A table giving all possible truth values of a statement is called truth
table.
Example:-
Which of the following open statements are true ?

1) x + 4 = 6 when x = 2
2) x + 4 6 when x = 2
3) x + 5 8 when x = 3
4) 2x + 4y = 14 when x = 1, y = 3
5) 3x + 5y = 11 when x = 0, y = 2
6) 5 e (4, 2, x) when x = 5
Logical Connectives
 Every statement must be either true or false but not both.
 If statements, they can be combined to produce a new

statement. These statements are called compound statements.
 To combine statements we use following symbols.

Conjunction(‘’ or ‘and’)
 If p and q are statements, the compound statement ‘p q’ is ‘p and q’ and is

called ‘p conjunction q’ or ‘p meet q’.
Example:-
1. Let us consider
p: Neeta is in senior K.G.
q: Neeta likes drawing,
then p q is the statement
Neeta is in senior K.G. and likes drawing.
 Definition
When two or more statements are combined by the word ‘and’ the
compound statement is known as ‘conjunction’.
Examples:-
Let us consider the statements.
2. p: 3 2
q: 9 is an odd number,
3 2 and 9 is an odd number.
3. p: 25 is divisible by 5.
q: Neeta likes swimming,
25 is divisible by 5 and Neeta likes swimming.
Remarks
1) If there is no connection between two statements still we can combine them

in logic.
2) ‘But’ and ‘while’ are treated as equivalent words to ‘and’.
3) Conjunction is a binary connectives as in conjunction we need atleast two

statements to combine.
1. If p is true and q is true then p q means the resulting statement is true.
2. If p is false and q is false then p q is false.
3. If p is false and q is true then p q is false.
4. If p is true and q is false then p q is false.
Truth table for p q

p q pq
T T T
F F F
T F F
F T F
 p q is true only when both are true otherwise false.

Disjunction (‘ᴠ’ or ‘OR’)
 When two or more statements are combined by the word ‘or’, the compound
statement is known as ‘Disjunction’.
 The symbol ‘p q’ is read as ‘p or q’ or ‘p disjunction q’ or ‘p join q’.

It is also known as ‘Alternation’ and an operand of a disjunction is called
a disjunct.
Examples :-
Let us consider the following statements,

1) p : a is equal to 5.
q : b is equal to 7.
then p ᴠ q is the statement.
a is equal to 5 or b is equal to 7.
i.e.,
1. If p is true and q is true then p ᴠ q is true.
2. If p is true and q is false then p ᴠ q is true.
3. If p is false and q is true then p ᴠ q is true.
4. If p is false and q is false then p ᴠ q is false.
Truth table for p v q
p q pvq
T T T
T F T
F T T
F F F
Remarks :
 ‘p q’ is true if either p is true or q is true or both p or q are true and ‘p q’ is false if both p and q are false.
 Disjunction is a binary connective.
 The exclusive disjunction or exclusive ‘OR’ of two propositions p and q is the statement. ‘Either p is true or q is
true ,but both are not true.’
 Either p is true or q is true, but both are not true, we denote this by ‘p q’.
 Inclusive ‘OR’ of two propositions p & q is the statement. ‘Either p is true or q is true or both true.’ i.e., p q.
 Truth table for p q :-
p q p q
T T F
T F T
F T T
F F F
 Example for exclusive ‘OR’ :
I shall go for walk or I shall watch TV. Here the connective ‘or’ is used in exclusive sense i.e., Either one or the
other is possible at a time both are not possible.
 Negation :
Let p be any statement then negation of p is denoted by, (or p’) read as ‘not p’. If p is true then is false and if p is
false then is true.
 Truth table :
T F
F T
 is a unary connective as only one statement is required to inform to form negation.

Examples :-
 If p is the statement ‘He is intelligent boy’,

then is the statement.
‘He is not intelligent boy.’
or ‘It is not the case that He is intelligent boy.’
 If p is the statement ‘I like to read’,

the is the statement.
‘I don’t like to read.’
or ‘It is not the case that I like to read.’

Government Engineering College Gandhinagar Group G1

Uploaded by

Copyright:

Available Formats

Government Engineering College Gandhinagar Group G1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Government Engineering College Gandhinagar Group G1

Uploaded by

Copyright:

Available Formats

Government Engineering

Parekh Moxa S. 180130107050

 Statements (or Propositions)

i.e. A sentence of which it is meaningful, to say, whether it is true or false

We denote statements by letters p, q, r, s......

1. Pune is capital of India.

1) A statement is a declarative sentence with a definite truth value.

2) Hence 1, 2, 3, 5, 7 are statements.

3) 4 is not a statement since its truth value depends on the value of y. If y is 4

4) Also 6 is not a statement since its truth value depends on set A, if

Which of the following open statements are true ?

 If statements, they can be combined to produce a new

 To combine statements we use following symbols.

 If p and q are statements, the compound statement ‘p q’ is ‘p and q’ and is

1) If there is no connection between two statements still we can combine them

2) ‘But’ and ‘while’ are treated as equivalent words to ‘and’.

3) Conjunction is a binary connectives as in conjunction we need atleast two

Truth table for p q

 p q is true only when both are true otherwise false.

 The symbol ‘p q’ is read as ‘p or q’ or ‘p disjunction q’ or ‘p join q’.

Let us consider the following statements,

Truth table for p v q

 is a unary connective as only one statement is required to inform to form negation.

 If p is the statement ‘He is intelligent boy’,

 If p is the statement ‘I like to read’,

You might also like