Chapter 6 Logic | PDF | If And Only If | Contradiction
Scribd
Upload
18 views

Chapter 6 Logic

The chapter discusses logic and set theory. It defines logic, statements, open and closed statements, fundamental logical connectives like negation, conjunction, disjunction, implication and bi-implication. It also discusses compound propositions formed using these connectives and their properties and laws. It defines tautology, contradiction and equivalent statements.

Uploaded by

muniirabdulaahi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Chapter 6 Logic

The chapter discusses logic and set theory. It defines logic, statements, open and closed statements, fundamental logical connectives like negation, conjunction, disjunction, implication and bi-implication. It also discusses compound propositions formed using these connectives and their properties and laws. It defines tautology, contradiction and equivalent statements.

Uploaded by

muniirabdulaahi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Mathematics form 3 chapter six

Chapter 6 : logic and set theory


Objectives
 By the end of this chapter students should be able to
 Define the concept of logic
 Statements and open statements
 Fundamental logical connectives (or operators)
 Compound propositions
 Properties and laws of logical connectives, contradiction and
tautology, converse, and contra positive.

6.1. Logic

Statements (proposition)

1
©Abdirashid fiiraan
Mathematics form 3 chapter six

Not Statements (not proposition)

A sentence which cannot be said to be true or false but not both is called
not statement or not proposition.
Example
1. What is your name?
2. Stand up
3. Welcome
4. Are you doctor
5. Shut up
Open Statements (open proposition)

2
©Abdirashid fiiraan
Mathematics form 3 chapter six

Fundamental logical connectives (operators)

Given two or more propositions, you can use connectives to join the sentence. The fundamental
connectives in logic are: not,or, and, if……then, if and only if.
A compound statement is a statement consisting of two or more statements joined by one or
more connectives.
Connective Name of the connective Symbols How to write How to read
Not Negation "� " �𝑝 The negation of p

And Conjunction "∧" 𝑝 ∧ 𝑞 p and q

Or disjunction “∨” 𝑝 ∨ 𝑞 p or q

If …...then .. implication ”⇒” 𝑝 ⇒ 𝑞 p implies q

If and only if Bi-implication “⇔” 𝑝 ⇔ 𝑞 p if and only if q

Rule 1: Negation

3
©Abdirashid fiiraan
Mathematics form 3 chapter six

Note: the word “not” denoted by ¬” “is applied to a single statement and does not connect two
statements

Example

Compound statements
Rule 2: Conjunction

Example

4
©Abdirashid fiiraan
Mathematics form 3 chapter six

Rule 3: Disjunction

Example

Rule 4: Implication

5
©Abdirashid fiiraan
Mathematics form 3 chapter six

Example
P: you work hard
q: you will pass the exam
P→q : if you work hard , then you will pass the exam

Rule 5: Bi-implication

Example
P: I will pass
q: I study hard

bi-implies q : I will pass if and only if I study hard

6
©Abdirashid fiiraan
Mathematics form 3 chapter six

7
©Abdirashid fiiraan
Mathematics form 3 chapter six

Tautology, contradiction and equivalent statements


1) Tautology: is any statement which is always true (true truth value).
2) Contradiction: is any statement which is always false.
3) Equivalent statements: statements which have identical truth value.
Examples
1) Show that these propositions are tautology, contradiction or neither.

8
©Abdirashid fiiraan
Mathematics form 3 chapter six

9
©Abdirashid fiiraan
Mathematics form 3 chapter six

10
©Abdirashid fiiraan
Mathematics form 3 chapter six

General example:

Exercise :
Construct one truth table for each of the following pairs of
Compound proposition and compare their truth values:
a. [p Λ (~ p V q)] ↔ (p Λ q)
b. (~ p Λ ~ q) ↔ ~ (p V q)
c. ~ (p → q) ↔ (p V q)
d. (p → ~ q) ↔ ~ (p Λ q)
e. (p → q) → (~ p V q)

11
©Abdirashid fiiraan

You might also like