Discrete Mathematics For Computer Scientists

CSM 165: Discrete Mathematics
for Computer Science
Chapter 1: Propositional and first order predicate logic




Isaac Afari Addo <>
National Institute for Mathematical Science (NIMS) - Ghana
Department of Mathematics, KNUST
Kumasi-Ghana.




12/02/2021

,Content

Introduction

Course Outline

Propositional and first order predicate logic

Propositional Equivalence

Inference

First Order Predicate Logic

Introduction to Proofs


CSM 165: Discrete Mathematics Chapter 1: Propositional and first order predicate logic, 12/02/2021

,Introduction

What is discrete mathematics?
Ï Discrete mathematics is the part of mathematics devoted to
study discrete objects.
■ Discrete Means not continuous or unconnected :

Discrete Verses Continuous (examples)

1. Natural Numbers are 1. Real numbers are
discrete continuous
fwwwwwwwwwwwwwwwww
2. Analog clock are
2. Digital clock are discrete
continuous
NB: here we mean the analog clock with the second, minute and
hour hand moving/sweeping continuously.

CSM 165: Discrete Mathematics Chapter 1: Propositional and first order predicate logic, 12/02/2021

, Introduction Cont’d

Discrete Mathematics helps in solving Problems such as:
Ï Is there a link between two computers in a network?

Ï Sorting a list of integers.

Ï Finding the shortest path from your home to your friend’s
house.

Ï How many different combinations of passwords are
possible with just 9 alphanumeric characters?

Ï How can I identify spam e-mail messages?



CSM 165: Discrete Mathematics Chapter 1: Propositional and first order predicate logic, 12/02/2021