0% found this document useful (0 votes)
172 views32 pages

DBM20083 Mathematic Discrete - Notes LW1

This document provides an overview of basic logic and proofs in discrete mathematics. It discusses: 1) The purpose of propositional logic is to evaluate statements as true or false using logical connectives. The main connectives are negation, conjunction, disjunction, conditional, and biconditional. 2) Examples are provided to illustrate how to derive the truth value of statements using each logical connective. Truth tables are also introduced as a method to systematically determine the truth value of compound statements with multiple propositions. 3) Exercises are given for students to practice applying logical connectives to express statements symbolically and determine their truth values using truth tables. This includes evaluating complex statements with nested connectives.

Uploaded by

Muhammad Afifi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
172 views32 pages

DBM20083 Mathematic Discrete - Notes LW1

This document provides an overview of basic logic and proofs in discrete mathematics. It discusses: 1) The purpose of propositional logic is to evaluate statements as true or false using logical connectives. The main connectives are negation, conjunction, disjunction, conditional, and biconditional. 2) Examples are provided to illustrate how to derive the truth value of statements using each logical connective. Truth tables are also introduced as a method to systematically determine the truth value of compound statements with multiple propositions. 3) Exercises are given for students to practice applying logical connectives to express statements symbolically and determine their truth values using truth tables. This includes evaluating complex statements with nested connectives.

Uploaded by

Muhammad Afifi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 32

DBM20083-DISCRETE

MATHEMATICS
~Lecture Week 1~
CHAPTER 1: BASIC LOGIC AND PROOFS
1.1 Derive Propositional Logic
1.1.1 Define the purpose of proposition logic
1.1.2 Carry out the formulae in proposition logic
(a) Negation
(b) Conjuction
(c) Disjunction
(d) Conditional
(e) Biconditional
(f) Tautology
1.1.3 Identify the compound proposition
1.1.4 Construct the truth table
1.1.1 DEFINE THE PURPOSE OF PROPOSITION LOGIC

A proposition (or statement) is a sentence that is either True or False.

Examples of proposition: Examples of Non Proposition :


5+3=8 True
Where do you live? question form
10÷2=4 False
Please answer the question correctly.
5 is an even number. instruction

Today is Wednesday. x < 10 Unknownvalue of x

• Letters are used to denote propositional variables. Example: p, q, r, s, …

• The truth value of a proposition


*True proposition (T)
*False proposition (F)
Exercise 1A
Which of these sentences are proportions? What are the truth values of those
that are propositions?
(1)Kuala Lumpur is the capital of Malaysia.
(2)8+2=10
(3)−48 < −47
(4)Do you want to go to a cinema?
(5)Answer this question.
(6)x + 2 = 18
(7)Today is Monday.
(8)Move this table to the other room
1.1.2 CARRY OUT THE FORMULA IN PROPOSITION LOGIC

Connectives in Proposition Logic

Conjunction Disjunction Negation


𝑝∧𝑞 𝑝∨𝑞 ¬𝑝 /~𝑝

Conditional Biconditional
𝑝→𝑞 𝑝↔𝑞
CONJUNCTION
𝑝 ∧ 𝑞 (READ AS 𝑝 AND 𝑞)
Example: The truth value of 𝑝 ∧ 𝑞
𝑝: 5 + 3 = 8 𝑝 𝑞 𝑝∧𝑞
𝑞:A decade is 10 years.
T T T
T F F
𝑝∧𝑞
5 + 3 = 8 and a decade is 10 F T F
years. F F F

Another answer
𝑝∧𝑞
5 + 3 = 8 but a decade is 10
years.
Example:
Determine the following statement is true (T) or false (F):
Kota Kinabalu is in Sabah and 2+2=4
Answer:
𝑇∧𝑇 =𝑇

Exercise 1B
Determine whether the statements are true (T) or false (F).
(1)3+2=5 and 4+4=8
(2)Changlun is in Perlis and Alor Setar is in Kedah.
(3)−48 < −47 and 25+3=38
(4)Duck has 4 legs and cat has wings.
5 3 47
(5)4x + 3x = 5x and + =
4 7 28
DISJUNCTION
𝑝 ∨ 𝑞 (READ AS 𝑝 OR 𝑞)

Example: The truth value of 𝑝 ∨ 𝑞


𝑝: 5 + 3 = 8 𝑝 𝑞 𝑝V𝑞
𝑞:A decade is 10 years. T T T
T F T
F T T
𝑝∨𝑞
F F F
5 + 3 = 8 or a decade is 10
years.
Example 2
Determine the following statement is true (T) or false (F):
Kota Kinabalu is in Sabah or 2+2=4
Answer:
𝑇∨𝑇 =𝑇

Exercise 1C
Determine whether the statements are true (T) or false (F).
(1)3+2=5 or 4+4=8
(2)Changlun is in Perlis or Alor Setar is in Kedah.
(3)−48 < −47 or 25+3=38
(4)Duck has 4 legs or cat has wings.
5 3 47
(5)4x + 3x = 5x or + =
4 7 28
Example:
NEGATION
¬𝑝 (READ AS NOT 𝑝)
Write the negation for each of the following
proposition.
(a) 5 + 3 = 8 The truth value of ¬𝑝
(b) A decade is 10 years. 𝑝 ¬𝑝

(c) All students are opera singers. T F


F T
(d) Some rectangles are squares.
Answer:
(a) 5 + 3 ≠ 8
(b) A decade is not 10 years. Another
answer: It is not the case that a decade is
10 years
(c) Some students are not opera singers.
(d) No rectangles are squares.
Exercise 1D
What is the negation of each of these propositions?
(1)Today is Tuesday.
(2)China is in Asia
(3)2 + 1 = 3
(4)All kittens are cute.
(5)No prime number is even.
(6)Some cookies are sweet.
(7)Every lawyer uses logic.
(8)No bullfrog has lovely eyes.
CONDITIONAL
𝑝 → 𝑞 (READ AS IF 𝑝, THEN 𝑞)
Example:
The truth value of 𝑝 → 𝑞
𝑝: I do my homework.
𝑝 𝑞 𝑝→𝑞
𝑞: I get my allowance. T T T
𝑝→𝑞 T F F
If I do my homework, then I get an F T T
allowance. F F T

Another ways to express conditional statement:


(a) If p, q
(b) p is sufficient for q
(c) q if p
(d) q when p
(e) a necessary condition for q is p
Exercise 1E
Let 𝑝 be “ It is cold” and 𝑞 be “ It is raining”. Give a simple sentence which
describes each of the following statements:
(a)p → q
(b)q → ¬p
(c)¬𝑞 → ¬𝑝
BICONDITIONAL
𝑝 ↔ 𝑞 (READ AS 𝑝 IF AND ONLY IF 𝑞)
Example: The truth value of 𝑝 ↔ 𝑞
𝑝: You passed the exam. 𝑝 𝑞 𝑝↔𝑞
𝑞: You scored 65% or higher. T T T
𝑝↔𝑞 T F F
You passed the exam if and only if F T F
F F T
you scored 65% or higher.

Another ways to express biconditional statement:


(a) p is necessary and sufficient for q
(b) if p then q, and conversely
(c)p iff q
Exercise 1F
Let 𝑝 be “ It is cold” and 𝑞 be “ It is raining”. Give a simple sentence which
describes each of the following statements:
(a)p ↔ q
(b)q ↔ ¬p
Exercise 1G (Question 1)
Which of these sentences are propositions? State the truth value of those that are
propositions?
(a) If it snows, then the schools are closed.
(b) x + 2 is positive.
(c) Take the umbrella with you.
(d) No prime number is even.
(e) A triangle is not a polygon. (*polygon is a closed path)
Exercise 1G (Question 2)
Let p and q be the propositions
p: Andy is going to Brunei
q: Andy is having a holiday.
Express each of these propositions as an English sentence.
(a) ¬p
(b) 𝑞 ∨ ¬p
(c)¬p ∧ ¬q
(d) p ↔ q
Exercise 1G (Question 3)
Represent the sentences below as propositional expressions:
(a) Tom is a math major but not computer science major.
(b) You can either stay at the hotel and watch TV or you can go to the museum
(c) If it is below freezing, it is also snowing.
Exercise 1G (Question 4)
Determine whether each of these statements is true or false.
(a) If 1+1=2, then 2+2=5
(b) If monkeys can fly, then 1+1=3
(c) 2+2=4 if and only if 1+1=2
(d) 0>1 if and only if 2>1
PAST YEAR QUESTIONS SESI II: 2021/2022

QUESTION 1
Identify each of the following sentence whether a proposition or not and state the
truth value.
(a) Is 2 a positive number? (1 mark)
(b) A triangle is a three-sided polygon (2 marks)
(c) 4+9 > 9 (2 marks)
QUESTION 2
Let p denote “ John is rich” and q denote “ John is happy”. Write each statement in
symbolic form using p and q.
(a) If John is rich, then he is unhappy.
(b) John is neither rich nor happy.
(c) It is necessary to be poor in order to be happy.
(d)John is unhappy if and only is he is poor.
(e)To be poor is to be unhappy.
(10 marks)
1.1.4 METHOD FOR CONSTRUCTING TRUTH TABLES
A logical statement/proposition having n component
statements will have 2𝑛 rows in its truth table.

Example:
If we have two propositions (p and q), therefore, we will have
22 =4 rows.
If we have three propositions (p, q and r), therefore we will Three propositions
have 23 =8 rows.
Look at the picture below: 𝑝 𝑞 𝒓
T T T
Two propositions
T T F
𝑝 𝑞 T F T
T T T F F
T F F T T
F T F T F
F F F F T
F F F
Example:
Construct the truth table for 𝑝 ∧ ¬𝑝𝑉¬𝑞

Solution:
First, we know that there are 2 propositions involved. Therefore, there will be 4 rows in
the
truth table.
Next, there are brackets and 2 negations (2 additional columns) connected with the
symbol 𝑉 (1 additional column) and the last column is what we need to construct.
𝑝 𝑞 ¬𝑝 ¬𝑞 ¬𝑝𝑉¬𝑞 𝑝 ∧ ¬𝑝𝑉¬𝑞
T T F F F F
T F F T T T
F T T F T F
F F T T T F
Example:
If 𝑝 represents the statement 4 > 1, 𝑞 represent the statement 12 < 9, and 𝑟 represent 0 <
1,decide whether the following statement is TRUE or FALSE.
¬𝑝 ∧ 𝑟 𝑉 ¬𝑞 ∧ 𝑝

Solution:
𝑝 𝑞 𝑟 ¬𝑝 ¬𝑞 ¬𝑝 ∧ 𝑟 ¬𝑞 ∧ 𝑝 ¬𝑝 ∧ 𝑟 𝑉ሺ¬𝑞
∧ 𝑝ሻ
The truth
T T T F F F F F value
T T F F F F F F for the
T F T F T F T T statement is
TRUE.
T F F F T F T T
F T T T F T F T
F T F T F F F F
F F T T T T F T
F F F T T F F F
Exercise 1H
Construct the truth table for each of the following:
(a) ¬𝑝 ∧ 𝑞
(b) ¬𝑝 𝑉 𝑞 → ¬𝑞
(c) 𝑝 ∧ ¬𝑞 𝑉 𝑟
(d) ¬𝑝 ↔ 𝑞 𝑉 𝑟
LOGICAL EQUIVALENCE

Two statement forms are called logically equivalent (≡ ) if and only if they have
same truth value in every possible situation.

Example: Example:
Are the following statements Determine whether the statement forms
equivalent? ¬ 𝑝 ∧ 𝑞 and ¬𝑝 ∧ ¬q are logically equivalent or
𝑝 ∧ 𝑞 and 𝑞 ∧ p not.

Solution: Solution:
𝑝 𝑞 𝑝∧𝑞 𝑞∧p 𝑝 𝑞 𝑝∧𝑞 ¬ 𝑝∧𝑞 ¬𝑝 ¬q ¬𝑝 ∧ ¬q
T T T T T T T F F F F
T F F F T F F T F T F

F T F F F T F T T F F
F F F T T T T
F F F F
𝑝∧𝑞 ≡𝑞∧p ¬ 𝑝 ∧ 𝑞 ≢ ¬𝑝 ∧ ¬q
LOGICAL EQUIVALENCES
Given any statement variables 𝑝, 𝑞 𝑎𝑛𝑑 𝑟, a tautology 𝒕 and a contradiction 𝒄, the
following logical equivalences hold :
1. Commutative laws : 𝑝Λ𝑞 ≡𝑞Λ𝑝 𝑝V𝑞 ≡𝑞V𝑝
2. Associative laws : 𝑝Λ𝑞 Λ𝑟 ≡𝑝Λ 𝑞Λ𝑟 𝑝V𝑞 V𝑟 ≡𝑝V 𝑞V𝑟
3. Distributive laws : 𝑝Λ 𝑞V𝑟 ≡ 𝑝Λ𝑞 V 𝑝Λ𝑟 𝑝V 𝑞Λ𝑟 ≡ 𝑝V𝑞 Λ 𝑝V𝑟
4. Identity laws : 𝑝Λ𝒕 ≡𝑝 𝑝V𝒄 ≡𝑝
5. Negation laws : 𝑝V¬𝑝 ≡𝒕 𝑝Λ¬𝑝 ≡𝒄
6. Double negative law : ¬ ¬𝑝 ≡𝑝
7. Idempotent laws : 𝑝Λ𝑝 ≡𝑝 𝑝V𝑝 ≡𝑝
8. Universal bound laws : 𝑝V𝒕 ≡𝒕 𝑝Λ𝒄 ≡𝒄
9. De Morgan’s laws : ¬ 𝑝Λ𝑞 ≡¬𝑝V¬𝑞 ¬ 𝑝V𝑞 ≡¬𝑝Λ¬𝑞
10. Absorption laws : 𝑝V 𝑝Λ𝑞 ≡𝑝 𝑝Λ 𝑝V𝑞 ≡𝑝
11. Negations of 𝒕 and 𝒄 : ¬𝒕 ≡𝒄 ¬𝒄 ≡𝒕
Exercise 1I
1. Show that the statements below are logically equivalent or not.
a) i: ¬ 𝒑 𝚲 𝒒
ii: ¬ 𝒑 𝑽 ¬ 𝒒

b) i: ¬ 𝒑 ↔ 𝒒
ii: ¬ 𝒒 ↔ 𝒑

2. Use truth tables to show that: 𝒑𝑽𝒒 → 𝒓  [ሺ𝒑 → 𝒓ሻ  ሺ𝐪 → 𝒓ሻ]


PAST YEAR QUESTIONS SESI II: 2021/2022

QUESTION 1
Show that 𝑝 → 𝑞 and ~𝑝 → ~𝑞 are NOT logically equivalent to each other.
(5 marks)
TAUTOLOGY, CONTRADICTION & CONTIGENCY

TAUTOLOGY CONTRADICTION
A proposition 𝑃 𝑝, 𝑞, 𝑟, … … is a A proposition 𝑃 𝑝, 𝑞, 𝑟, … … is a contradiction if it
tautology if it contains only T in the contains only F in the last column of its truth table.
last column of its truth table. In other words they are false for any truth values of
In other words they are true for any their variables.
truth values of their variables.

Example: Example:

𝑝 ¬𝑝 𝑝 ∧ ¬𝑝
𝑝 ¬𝑝 𝑝 𝑽¬𝑝 T F F
T F T F T F
F T T

The proposition 𝑝 𝑽¬𝑝 is a tautology. The proposition 𝑝 ∧ ¬𝑝 is a contradiction.


CONTIGENCY
A proposition 𝑃 𝑝, 𝑞, 𝑟, … … is a contingency if it contains both T and F in the last
column of its truth table.

Example:
𝑝 𝑞 𝒑𝐕𝒒
T T T
T F T
F T T
F F F

The proposition 𝑝 ∨ 𝑞 is a contigency.


Exercise 1J
1. Use the truth table to determine whether the statement ሺ 𝒑 → 𝒒 ⋀ 𝒑 ሻ → 𝒒 is a
tautology, contradiction or contingency.

2. Use a truth table to show that the proposition 𝒑⋁ 𝒒⋁ ∼ 𝒑 is always true (T).

3. Determine whether the proposition is tautology or not, ሺ𝒑 → 𝒒ሻ⋀ሺ𝒒 → 𝒑ሻ ↔ ሺ𝒑 →


¬𝒒ሻ.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy