HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
Statements, Connectives and Truth Tables
  1. 1Statements and their negations
  2. 2Connectives and truth tables
  3. 3Tautologies, equivalence and switching circuits
  1. Mathematics
  2. /Statements, Connectives and Truth Tables
  3. /Statements and their negations

Course 36.1·Lesson 1 of 3

Statements and their negations

A statement is a sentence that is either true or false, but not both. Questions, commands, wishes and opinions are not statements, and an open sentence such as x+3=5x + 3 = 5x+3=5 becomes one only when xxx

Lesson 1 of 3Show all lessonsHide
Statements, Connectives and Truth Tables
  1. 1Statements and their negations
  2. 2Connectives and truth tables
  3. 3Tautologies, equivalence and switching circuits

Try the code and the simulations beside the lesson.

What you will be able to do

  • decide whether a sentence is a statement;
  • give the truth value of a statement;
  • write the negation of a statement correctly;
  • tell simple statements from compound ones.

Sentences that can be judged

Your friend says, "The bus to the station leaves at eight." You can check it. It is either true or false. Now your friend says, "Please wait for me." You cannot call that true or false. It is a request.

In mathematics we reason only with sentences of the first kind.

A statement is a sentence that is either true or false, but not both.

Whether it is true or false is its truth value. We write T for true and F for false. Some books use 1 and 0.

Here are some sentences. Decide for each one before you read on.

  1. "777 is a prime number." This is a true statement.
  2. "Every rectangle is a square." This is a false statement. A rectangle of 2 cm2\ \text{cm}2 cm by 5 cm5\ \text{cm}5 cm is not a square.
  3. "Close the window." This is a command, not a statement.
  4. "How far is the station?" This is a question, not a statement.
  5. "Mathematics is the most interesting subject." This is an opinion. People disagree, so it is not a statement.
  6. "Today is Monday." Its truth depends on the day you say it. Most books do not count it as a statement.

A false sentence is still a statement. The test is not "is it true?". The test is "can it be judged true or false, and only one of them?".

Open sentences

Look at "x+3=5x + 3 = 5x+3=5". It is true when x=2x = 2x=2 and false for every other xxx. Until we know xxx, we cannot judge it. A sentence with a variable like this is an open sentence.

An open sentence becomes a statement in two ways:

  • put a value in place of the variable, as in "2+3=52 + 3 = 52+3=5";
  • add words that say for which values, as in "for every real number xxx, x2≥0x^2 \ge 0x2≥0".

The second way uses quantifiers. You meet them in the next course.

The negation of a statement

The negation of a statement ppp is the statement "it is false that ppp". We write it ∼p\sim p∼p and read it "not ppp". Many books outside India write ¬p\neg p¬p. It means the same.

The rule is short. When ppp is true, ∼p\sim p∼p is false. When ppp is false, ∼p\sim p∼p is true.

ppp∼p\sim p∼p
TF
FT

Negating twice brings you back: ∼(∼p)\sim(\sim p)∼(∼p) has the same truth value as ppp.

Negating with care

Usually you can put "not" in the right place.

  • ppp: "2\sqrt{2}2​ is a rational number." Then ∼p\sim p∼p: "2\sqrt{2}2​ is not a rational number."
  • ppp: "The train is late." Then ∼p\sim p∼p: "The train is not late."

The trap is to jump to an opposite instead of the negation.

  • The negation of "xxx is positive" is "xxx is not positive". That means x≤0x \le 0x≤0. It is not "xxx is negative", because x=0x = 0x=0 is neither.
  • The negation of "Ravi is taller than Sam" is "Ravi is not taller than Sam". Ravi may be shorter, or exactly as tall.

A negation and its statement must always have opposite truth values. Use that as your check.

Sentences with "all" and "some" need extra care. The negation of "All the lamps are on" is "Some lamp is not on". It is not "All the lamps are off". You will see the rule for these in the course on quantifiers.

Simple and compound statements

A simple statement cannot be broken into smaller statements. "555 is odd" is simple.

A compound statement is made of simple statements joined by words such as "and", "or", "if ... then" and "if and only if". These words are connectives. The parts are the components.

  • "555 is odd and 555 is prime" has the components "555 is odd" and "555 is prime".
  • "The sum of 444 and 666 is 101010" is a simple statement. Here "and" joins two numbers, not two statements.

Practise with new numbers

Try it in Python

The program writes a few statements as Python truth values, True or False, and prints each one with its negation.

Read it first. Then run it. Does every negation print the opposite value of its statement?

1. Add the statement 13 % 4 == 1 with a name of your own. Predict its value before you run it.

2. The last line tests an open sentence for six values of x. Change the sentence to x * x > 4. For which values is it true now?

Common mistakes

  • Calling a false sentence a non-statement. "Every rectangle is a square" is false, and it is a statement.
  • Negating to the opposite. The negation of "positive" is "not positive", which includes zero.
  • Counting an open sentence as a statement. "xxx is even" has no truth value until xxx is known or quantified.
  • Seeing a connective in every "and". "The sum of 444 and 666" is one statement.

Remember these

  • A statement is true or false, but not both.
  • ∼p\sim p∼p is true exactly when ppp is false, and ∼(∼p)\sim(\sim p)∼(∼p) has the truth value of ppp.
  • A statement and its negation always have opposite truth values.
  • Compound statements are joined by connectives.

Check yourself

Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.

  1. Is "There is a prime number between 909090 and 969696" a statement? If it is, give its truth value.
  1. Write the negation of "The number 000 is a natural number" and give the truth value of each.
  1. A student writes the negation of "The temperature is above 20∘C20^\circ\text{C}20∘C" as "The temperature is below 20∘C20^\circ\text{C}20∘C". What is wrong?
  1. Which of these are statements: (a) "Is 171717 prime?" (b) "x2=9x^2 = 9x2=9" (c) "The square of every real number is at least 000"?
  1. Find the components of "121212 is divisible by 333 and by 444".

References

  • NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, Mathematical Reasoning.
  • OpenStax, Contemporary Mathematics, Chapter 2, Logic.

Enroll free in Statements, Connectives and Truth Tables

Every lesson is open to read. Enrolling also lets you:

  • Mark lessons done and carry on where you stopped.
  • Take the tests of this lesson and its course.
  • Count the course towards the certificate for its chapter.
No payment. You can leave at any time.

Problems (3)

A school notice board shows six sentences…Hard · High School (11–12) · by StemPy Lab
Let p(n) be the open sentence "n² - 9n + 18 < 0", where n is a whole number from 1 to 12…Hard · High School (11–12) · by StemPy Lab
A thermostat sends a signal while the room temperature t, in degrees Celsius, satisfies "t is…Advanced · High School (11–12) · by StemPy Lab
Next: lesson 2Connectives and truth tables
← Statements, Connectives and Truth Tables
← PreviousConnectives and truth tables →

Discussion (0)

Log in to join the discussion.

Loading…

is fixed. The negation
∼p\sim p∼p
of a statement
ppp
is true exactly when
ppp
is false. Negating needs care: the negation of '
xxx
is positive' is '
xxx
is not positive', not '
xxx
is negative'.
about 30 min1 simulation1 practice question1 Python program5 questions to check yourself

This lesson is free to read. Enroll free to keep your place and take the tests.