Mathematical logic gives you a precise language for reasoning. In this first exercise you decide whether a sentence is a statement at all, find its truth value, turn English sentences into symbols using the five connectives (and, or, if…then, if and only if, not), evaluate compound statements when the truth values of the parts are given, and write negations. Every later exercise in this chapter, including switching circuits, is built on these few tables, so learn them until they are automatic. This topic also appears regularly in MHT-CET as quick one-mark questions.
🎧 Listen to the summary
Summary: Exercise 1.1 – Statements, truth values, connectives and negation
A statement is a declarative sentence that is definitely true or definitely false, never both; questions, orders, requests, exclamations and open sentences are not statements.
Simple statements are joined by connectives: ∧ (and), ∨ (or), → (if…then), ↔ (if and only if); ~ negates a statement.
p ∧ q is true only when both parts are true; p ∨ q is false only when both parts are false.
p → q is false only in the case T → F; p ↔ q is true exactly when p and q have the same truth value.
To evaluate a compound statement, substitute T or F for each letter and simplify from the innermost bracket outwards.
Key points to remember
An open sentence contains a variable or a pronoun (x, he, it) whose value is not fixed, so its truth value cannot be decided; it is not a statement.
A sentence whose truth depends on personal taste ("Maths is interesting") is also not a statement.
Words such as 'but', 'yet', 'although' and 'while' are translated as ∧.
'Neither p nor q' means ~p ∧ ~q.
'p only if q', 'q is necessary for p' and 'p is sufficient for q' all mean p → q.
A conditional with a false hypothesis is always true: F → anything = T.
~(~p) ≡ p, so negating twice gives back the original statement.
The negation of an equality = is ≠, and the negation of > is ≤ (not <).
Order of priority when brackets are missing: ~ first, then ∧ and ∨, then →, then ↔. Always add brackets to be safe.
👩🏫
Want a teacher to explain Exercise 1.1 – Statements, truth values, connectives and negation?
Get a ✓ Verified tutor for “Exercise 1.1 – Statements, truth values, connectives and negation” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Exercise 1.1 – Statements, truth values, connectives and negation – Notes
1. What counts as a statement
Ask two questions: is the sentence declarative, and can everyone agree on whether it is true or false?
Facts of mathematics and science give statements: '7 is prime' (T), '2 + 2 = 5' (F).
Commands, requests, questions and exclamations are never statements.
Equations with an unknown, such as 2x + 1 = 9, are open sentences until x is given a value.
Once the variable is fixed ('2x + 1 = 9 when x = 4') the sentence becomes a statement with a definite truth value.
We use small letters p, q, r, s for statements and T, F for the truth values.
✏️ Solved example
Classify: (a) 11 is a composite number. (b) Shut the window. (c) y² = 16. (d) y² = 16 when y = −4.
(a) Declarative, and 11 is prime, so it is a statement with value F.
(b) A command, so it is not a statement.
(c) The value of y is not fixed, so it is an open sentence, not a statement.
(d) (−4)² = 16 is true, so it is a statement with value T.
Answer: (a) Statement, F (b) Not a statement (c) Not a statement (d) Statement, T
2. The five connectives and their tables
Conjunction p ∧ q: T only in the row T, T.
Disjunction p ∨ q: F only in the row F, F (inclusive 'or').
Conditional p → q: F only in the row p = T, q = F. Here p is the antecedent and q the consequent.
Biconditional p ↔ q: T when both have the same value (T, T or F, F).
Negation ~p: swaps T and F.
With two letters there are 2² = 4 rows; with three letters, 2³ = 8 rows.
✏️ Solved example
Let p: 9 is a perfect square (T), q: 15 is prime (F). Find the value of p ∧ q, p ∨ q, p → q, q → p and p ↔ q.
p ∧ q = T ∧ F = F.
p ∨ q = T ∨ F = T.
p → q = T → F = F (the only false case).
q → p = F → T = T.
p ↔ q = T ↔ F = F (different values).
Answer: F, T, F, T, F
3. Translating English into symbols
First name each simple statement in positive form, e.g. p: The angle is acute.
Then read the connecting words: 'and/but' → ∧, 'or' → ∨, 'if…then' → →, 'if and only if' → ↔, 'not' → ~.
Put any 'not' directly on the statement it belongs to: 'x is not prime but is odd' is ~p ∧ q.
A sentence such as '4 and 9 are perfect squares' can be split into two statements joined by ∧; '2 and 3 are coprime' cannot be split, so it is simple.
For 'neither…nor' write ~p ∧ ~q, never ~(p ∧ q).
✏️ Solved example
Write symbolically: 'The number is neither even nor a multiple of 5.'
Let p: The number is even, q: The number is a multiple of 5.
'Neither p nor q' means 'not p and not q'.
Answer: ~p ∧ ~q
4. Evaluating compound statements and writing negations
Replace each letter by its value, then work inside out: ~ first, then the brackets, then the main connective.
Keep a short running line like ~T ∧ (F ∨ T) ≡ F ∧ T ≡ F so you can check each step.
To negate a simple sentence, insert or remove 'not': 'Pune is in Gujarat' → 'Pune is not in Gujarat'.
For number sentences flip the relation: = ↔ ≠, < ↔ ≥, > ↔ ≤.
The negation must have the opposite truth value to the original; use this to check your work.
✏️ Solved example
p, r are true and q, s are false. Find the value of (p → q) ∨ ~(r ∧ s) and of (~p ↔ q) → s.
p → q = T → F = F; r ∧ s = T ∧ F = F, so ~(r ∧ s) = T.
First expression: F ∨ T = T.
~p = F, so ~p ↔ q = F ↔ F = T.
Second expression: T → s = T → F = F.
Answer: T and F
Formulas at a glance
What
Formula
Symbols
Conjunction
p ∧ q is T only for T, T
T ∧ F = F
Disjunction
p ∨ q is F only for F, F
F ∨ T = T
Conditional
p → q is F only for T → F
F → F = T
Biconditional
p ↔ q is T when values match
F ↔ F = T
Negation
~T = F, ~F = T; ~(~p) ≡ p
~(~T) = T
Neither…nor
~p ∧ ~q
Neither acute nor obtuse
Relation flips
= → ≠, > → ≤, < → ≥
Negation of 6 + 2 > 7 is 6 + 2 ≤ 7
Key terms
StatementA declarative sentence that is either true or false but not both.
Open sentenceA sentence whose truth value cannot be fixed because it contains a variable or depends on opinion.
Truth valueT if a statement is true, F if it is false.
Simple statementA statement that cannot be broken into smaller statements.
Compound statementTwo or more simple statements joined by connectives.
ConjunctionThe 'and' statement p ∧ q.
DisjunctionThe 'or' statement p ∨ q.
ConditionalThe 'if p then q' statement p → q; p is the antecedent, q the consequent.
BiconditionalThe 'p if and only if q' statement p ↔ q.
NegationThe statement ~p, true exactly when p is false.
✍️ Try it yourself
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1 (i)–(viii). Decide which are statements and give the truth value: (i) 5 + 4 = 13 (ii) x − 3 = 14 (iii) a command to close the door (iv) zero is a complex number (v) a request for breakfast (vi) congruent triangles are similar (vii) x² = x (viii) a quadratic equation has at most two roots.
Show solution
(i) Declarative and 5 + 4 = 9, so it is a statement, value F.
(ii) Contains an unfixed x, so it is an open sentence, not a statement.
(iii) A command, so not a statement.
(iv) 0 = 0 + 0i is a complex number, so it is a statement, value T.
(v) A request, so not a statement.
(vi) Congruent triangles have equal angles, so they are similar: statement, T.
(vii) Open sentence (true for x = 0 or 1 only), not a statement.
(viii) A quadratic has at most two roots, so it is a statement, value T.
Answer: (i) Statement, F (ii) Not (iii) Not (iv) Statement, T (v) Not (vi) Statement, T (vii) Not (viii) Statement, T
2. Q1 (ix)–(xv). (ix) a question about liking Mathematics (x) the sun sets in the west (xi) all reals are whole numbers (xii) a question about speaking Marathi (xiii) x² − 6x − 7 = 0 when x = 7 (xiv) the cube roots of unity add to zero (xv) it rains heavily.
Show solution
(ix) A question, so not a statement.
(x) A fact, so a statement with value T.
(xi) −2.5 is real but not whole, so it is a statement, value F.
(xii) A question, so not a statement.
(xiii) 49 − 42 − 7 = 0, so with x fixed it is a statement, value T.
(xiv) 1 + ω + ω² = 0, so it is a statement, value T.
(xv) 'It' and the time are not fixed; truth varies, so it is an open sentence, not a statement.
Answer: (ix) Not (x) Statement, T (xi) Statement, F (xii) Not (xiii) Statement, T (xiv) Statement, T (xv) Not
3. Q2. Write in symbols: (i) Nagpur is in Maharashtra and Chennai is in Tamilnadu (ii) the triangle is equilateral or isosceles (iii) an angle is right iff it measures 90° (iv) the angle is neither acute nor obtuse (v) if ΔABC is right-angled at B then ∠A + ∠C = 90° (vi) Hima Das wins gold iff she runs fast (vii) x is not irrational but is the square of an integer.
Show solution
(i) p: Nagpur is in Maharashtra, q: Chennai is in Tamilnadu → p ∧ q.
(ii) p: equilateral, q: isosceles → p ∨ q.
(iii) p: the angle is right, q: it measures 90° → p ↔ q.
(iv) p: acute, q: obtuse → ~p ∧ ~q.
(v) p: right-angled at B, q: ∠A + ∠C = 90° → p → q.
(vi) p: she wins gold, q: she runs fast → p ↔ q.
(vii) p: x is irrational, q: x is a square of an integer; 'but' is ∧ → ~p ∧ q.
Answer: (i) p ∧ q (ii) p ∨ q (iii) p ↔ q (iv) ~p ∧ ~q (v) p → q (vi) p ↔ q (vii) ~p ∧ q
4. Q3. Truth values: (i) 4 is odd or 1 is prime (ii) 64 is a perfect square and 46 is prime (iii) 5 is prime and 7 divides 94 (iv) it is not true that 5 − 3i is real (v) if 3 × 5 = 8 then 3 + 5 = 15 (vi) milk is white iff the sky is blue (vii) 24 is composite or 17 is prime.
Show solution
(i) F ∨ F = F (1 is not prime).
(ii) T ∧ F = F (46 = 2 × 23).
(iii) T ∧ F = F (94 = 7 × 13 + 3).
(iv) '5 − 3i is real' is F, so its negation is T.
(v) F → F = T.
(vi) T ↔ T = T.
(vii) T ∨ T = T.
Answer: (i) F (ii) F (iii) F (iv) T (v) T (vi) T (vii) T
(v) ~r = T, so ~r ↔ p = T ↔ T = T; ~q = F; T → F = F.
(vi) ~p = F, so the first bracket is F; q ∧ r = F and p ∧ r = F, so the second is F; F ∨ F = F.
(vii) ~p ∧ q = F, so the first bracket is F. q → p = T; ~s ∨ r = T ∨ F = T; T → T = T. F ∨ T = T.
(viii) ~p ∧ r = F; s → ~q = F → F = T; F ∨ T = T, negated gives F. p ∧ r = F. F ↔ F = T.
Answer: (v) F (vi) F (vii) T (viii) T
7. Q5. Write the negations: (i) Tirupati is in Andhra Pradesh (ii) 3 is not a root of x² + 3x − 18 = 0 (iii) √2 is a rational number (iv) polygon ABCDE is a pentagon (v) 7 + 3 > 5.
Show solution
(i) Insert 'not': Tirupati is not in Andhra Pradesh.
(ii) Remove 'not': 3 is a root of x² + 3x − 18 = 0 (check: 9 + 9 − 18 = 0, so the negation is in fact true).
(iii) √2 is not a rational number.
(iv) Polygon ABCDE is not a pentagon.
(v) The opposite of > is ≤: 7 + 3 ≤ 5.
Answer: (i) Tirupati is not in Andhra Pradesh. (ii) 3 is a root of x² + 3x − 18 = 0. (iii) √2 is not a rational number. (iv) ABCDE is not a pentagon. (v) 7 + 3 ≤ 5
Exercise 1.1 – Statements, truth values, connectives and negation – Flashcards
Read the question, answer it in your head, then tap the card to check. 20 cards.
Is 'Open the door.' a statement?
No, it is a command.
Tap to see the answer
Is 'x + 5 = 8' a statement?
No, it is an open sentence; its truth depends on x.
Tap to see the answer
When is p ∧ q true?
Only when p and q are both true.
Tap to see the answer
When is p ∨ q false?
Only when p and q are both false.
Tap to see the answer
When is p → q false?
Only when p is true and q is false.
Tap to see the answer
When is p ↔ q true?
When p and q have the same truth value.
Tap to see the answer
Value of F → F?
T
Tap to see the answer
Value of T ↔ F?
F
Tap to see the answer
Symbol for 'but'?
∧
Tap to see the answer
'Neither p nor q' in symbols?
~p ∧ ~q
Tap to see the answer
'p only if q' in symbols?
p → q
Tap to see the answer
'q is necessary for p' in symbols?
p → q
Tap to see the answer
~(~p) = ?
p
Tap to see the answer
Negation of 'a = b'?
a ≠ b
Tap to see the answer
Negation of '8 > 3'?
8 ≤ 3
Tap to see the answer
How many rows in a truth table with 3 letters?
2³ = 8
Tap to see the answer
Is '2 and 3 are coprime' simple or compound?
Simple; it cannot be split into two statements.
Tap to see the answer
Value of ~T ∨ F?
F ∨ F = F
Tap to see the answer
In p → q, what is p called?
The antecedent (hypothesis).
Tap to see the answer
Is 'How lovely!' a statement?
No, it is an exclamation.
Tap to see the answer
1 / 20
Exercise 1.1 – Statements, truth values, connectives and negation – MCQ Quiz
15 questions. Tap an option — you will see at once if it is right and why.
1. Which of these is a statement?
Answer: C. It is declarative and true; the others are a request, a question and an open sentence.
2. If p is T and q is F, p ∧ q is
Answer: D. ∧ needs both parts true.
3. If p is F and q is F, p → q is
Answer: B. A false antecedent makes the conditional true.
4. p ↔ q is true when
Answer: B. That is the definition of the biconditional.
5. 'Ravi is tall but not strong' in symbols (p: Ravi is tall, q: Ravi is strong) is
Answer: D. 'But' is ∧, and 'not strong' is ~q.
6. 'Neither p nor q' is
Answer: A. Both parts are denied.
7. The negation of '5 + 1 > 4' is
Answer: C. The opposite of > is ≤.
8. With p, q true and r false, (p ∨ r) → ~q is
Answer: D. T → F = F.
9. p ∨ q is false when
Answer: A. Inclusive 'or' fails only when both fail.
10. 'x² = 4' is
Answer: C. x is not fixed.
11. 'p is sufficient for q' is
Answer: A. Sufficient condition goes on the left of the arrow.
12. With p true and q false, ~p ↔ q is
Answer: A. ~p = F, and F ↔ F = T.
13. Which is not a statement?
Answer: B. An exclamation has no truth value.
14. A truth table for p, q, r has how many rows?
Answer: C. 2³ rows.
15. ~(~q) is
Answer: B. Double negation returns the statement.
👩🏫
Found this chapter hard? A tutor can help.
Get a ✓ Verified tutor for “Exercise 1.1 – Statements, truth values, connectives and negation” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
🎮 Revision Arcade — Exercise 1.1 – Statements, truth values, connectives and negation
Done with the notes? Revise Exercise 1.1 – Statements, truth values, connectives and negation the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP
How to study Exercise 1.1 – Statements, truth values, connectives and negation
⏱ About 45 minutes
Learn the tables (15 min) Write the truth tables of ∧, ∨, →, ↔ and ~ from memory until you can do it in under a minute, and learn the rule that marks the one special row of each.
Solve (20 min) Do Q1 and Q2 for recognising and translating statements, then Q3–Q4 for evaluation (write the running T/F line), and finish with Q5.
Check (10 min) Try it yourself on the practice list, take the quiz and play 🎮 Play.
⚠️ Common mistakes
Calling an open sentence like x² = x a false statement; it is not a statement at all.
Treating F → T or F → F as false; a conditional is false only for T → F.
🏆 Board exam tips
In one-mark MCQs on truth values, substitute T/F immediately and simplify inside out; never reason in words.
When negating '>' or '<', include the equality: the negation of > is ≤.
👩🏫
Prefer to study with a teacher?
Get a ✓ Verified tutor for “Exercise 1.1 – Statements, truth values, connectives and negation” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Stuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Mathematical Logic Ex 1.1” — important
questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Questions students asked about this chapter, answered and checked by TalentJR.
Q
Explain Mathematical Logic Ex 1.1 in simple words
A
Mathematical Logic is about understanding how to use symbols and statements to express logical ideas. In Exercise 1.1, you will learn about:
Statements: These are sentences that can be either true or false. For example, "It is raining" is a statement.
Logical Connectives: These are words that connect statements. The main ones are:
AND (∧): Both statements must be true.
OR (∨): At least one statement must be true.
NOT (¬): This reverses the truth of a statement.
Truth Tables: These are tables that show the truth values of statements based on different combinations of truth values for the connected statements.
In this exercise, you will practice identifying statements, using logical connectives, and creating truth tables. It helps you understand how to reason logically.
👩🏫 Class 12 Maths classes — live online, request a call back
Prefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what
you need and our team will call you with timings and fees.
💻Live online classesSmall groups or 1:1 with a teacher, from home, any city.
📞We call you backOur team asks what your child needs, then shares timings and fees.
🏠Home tutor?We are still building our list of home tutors — ask on the call if there is one near you.