STATEMENT AND

NOTATIONS
AGENDA

1.Introduction to Statements

2. Types of Statements

3. Notations for Statements

4. Logical Operators

5. Set Notation

6. Function Notation

7. Predicate Logic Notation

8. References

2
INTRODUCTION
TO STATEMENTS
 INTRODUCTION TO STATEMENTS

• In mathematics, a statement is a declarative sentence that is either true or false

but not both. A statement is sometimes called a proposition.
• To be a statement, a sentence must be true or false, and it cannot be both
• So a sentence such as "The sky is beautiful" is not a statement since whether the
sentence is true or not is a matter of opinion. A question such as "Is it raining?" is
not a statement because it is a question and is not declaring or asserting that
something is true
• Some sentences that are mathematical in nature often are not statements because
we may not know precisely what a variable represents

4
TYPES OF
STATEMENTS
TYPES OF STATEMENTS
Simple statement
• It is a declarative sentence that’s either true or false but
can’t be both.
• If the sentence is true, it has a truth value of true; if it’s
false, then the truth value is false.
• Simple statements are combined to form compound
statements. Simple statements are connected using
logical connectives such as ›AND, OR, and NOT.

Example Statements Simple, Compound or Neither

The sky is blue. Simple

6
 TYPES OF STATEMENTS
Compound statement
• It is a declarative sentence that’s either true or false but can’t be both.Formed by
combining atomic statements using logical operators.
• Compound statement is a group of two or more statements connected using words such as
'or', 'and', 'if then', 'if and only if’.
• Each statement of a compound statement is a component statement, which can be clearly
decided as a true or false statement.
• The individual statements are represented as p, q and the compound statements are
represented as p v q, p ^ q, p ⇒ q, p ⇔ q

Example Statements Simple, Compound or Neither

She likes chocolate and vanilla ice cream. Compound

7
 Example Statements Simple, Compound or Neither

The sky is blue. Simple

Cats and dogs are mammals. Compound

5 + 5 = 10 Simple

What time is it? Neither

Either the sun is shining, or it’s raining, and if it’s Compound

raining, then I’ll stay indoors.

She likes chocolate and vanilla ice cream. Compound

Don’t be late! Neither

He’s a doctor. Simple

8
NOTATIONS FOR
STATEMENTS
 NOTATIONS FOR STATEMENTS

• Logical Operators: Symbols like ∧ (AND), ∨ (OR), ¬ (NOT), → (implies), ↔ (if and only if).
• Set Notation: Symbols like ∈ (element of), ⊆ (subset of). Example: "x ∈ {1, 2, 3}" meaning "x
is an element of the set {1, 2, 3}".
• Function Notation: Symbols like f(x), representing functions acting on statements. Example:
"f(x) = 2x + 1" defines a function that doubles the input and adds one.
• Predicate Logic Notation: Symbols like ∀ (for all), ∃ (there exists). Example: " ∀x ∈ ℝ, x^2 ≥
0" means "For all real numbers x, x^2 is greater than or equal to 0."

10
 NOTATIONS FOR STATEMENTS
Logical Operators

• Conjunction (AND): Connects two statements and is true only if both statements are true. Example:
"It is raining (p) ∧ the sun is shining (q)" means both conditions must be true for a rainbow.
• Disjunction (OR): Connects two statements and is true if at least one statement is true. Example: "It is
raining (p) ∨ it is snowing (q)" means either rain or snow is occurring.
• Negation (NOT): Reverses the truth value of a statement. Example: "It is not raining ( ¬p) " means it
is false that it is raining.
• Implication (IF...THEN): Represents a conditional relationship between two statements. Example: " If
it is raining (p), then I will take an umbrella (q)" means if it is raining, I will take an umbrella.
• Biconditional (IF AND ONLY IF): Represents a relationship where both statements have the same
truth value. Example: "It is raining (p) ↔ I will take an umbrella (q)" means I will take an umbrella if
and only if it is raining

11
 NOTATIONS FOR STATEMENTS
Set Notation

• Set notations are the basic symbols used to denote the various representations across set operations
• The simplest set notation is the Curley brackets, which are used to enclose and represent the elements of
the set
• The elements of a set are written using flower brackets { }, or by using parenthesis ( ).

Set-builder Notation:
• Example Statement: "x is a prime number."
• Notation Explanation: In set notation, we represent sets of elements using braces {}. The vertical
bar "|" is read as "such that" and is used to describe the properties of the elements in the set. In this
example, the set is described as {x | x is a prime number}, which means it contains all elements x such
that x is a prime number

12
 NOTATIONS FOR STATEMENTS
Set Notation

• Set notations are the basic symbols used to denote the various representations across set operations
• The simplest set notation is the Curley brackets, which are used to enclose and represent the elements of
the set
• The elements of a set are written using flower brackets { }, or by using parenthesis ( ).

Roster or Tabular Notation:

• Example: {2, 3, 5, 7, 11}
• Explanation: Roster notation lists all the elements of a set explicitly within braces {}. Each element
is separated by commas. In the example, the set contains the prime numbers 2, 3, 5, 7, and 11.

13
 NOTATIONS FOR STATEMENTS
Function Notation

• A function assigns exactly one element of a set to each element of the other set. Functions are the rules
that assign one input to one output. The function can be represented as f: A ⇢ B. A is called the domain
of the function and B is called the codomain function
• Example Statement: "f(x) = 2x + 1"
• Notation Explanation: Function notation is used to describe relationships between sets. In this
example, f(x) represents a function named "f" that takes an input x and produces an output according to
the rule 2x + 1. The expression "f(x) = 2x + 1" means that the function f maps each value of x to the
corresponding value of 2x + 1.

14
 NOTATIONS FOR STATEMENTS
Predicate Logic Notation

• Predicate logic notation, also known as first-order logic, is a formal system used in mathematics and
logic to express statements about objects and their properties.
• It extends propositional logic by allowing variables, quantifiers, and predicates, enabling us to make
more complex statements and reason about relationships between objects
• Example Statement: "For all real numbers x, x^2 ≥ 0."
• Notation Explanation: Predicate logic notation is used to express statements about elements in a set.
The symbol ∀ (for all) is used to indicate that the statement applies to all elements in a specified set. In
this example, the statement ∀x ∈ ℝ, x^2 ≥ 0 reads as "For all real numbers x, x^2 is greater than or
equal to 0." It asserts that the square of any real number is always non-negative.

15
REFERENCES

•Books:
• "Discrete Mathematics and Its Applications" by Kenneth H. Rosen
• "Mathematics for Computer Science" by Eric Lehman, F. Thomson Leighton, and
Albert R. Meyer
• "Introduction to the Theory of Computation" by Michael Sipser
•Articles:
• "An Introduction to Propositional Logic" by Paul Teller
• "A Gentle Introduction to Predicate Logic" by Dave Pratt
•Websites:
• math.stackexchange.com
• Geeks for geeks
16
THANK YOU
Arjun Kollipara

7893480426

22h51a0502@cmrcet.ac.in

17