Scribd
Upload
21 views

DM 1b PropositionalLogic

This document outlines the topics to be covered in the Discrete Mathematics course, including propositional logic, propositions, logical operators, truth tables and conditional statements. It provides the course code, lecturer details, lecture outline, objectives and outcomes, and defines key logical terms and concepts. Examples are also given to illustrate propositional logic operators like negation, conjunction, disjunction and exclusive or.

Uploaded by

psychopsycho485
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views

DM 1b PropositionalLogic

This document outlines the topics to be covered in the Discrete Mathematics course, including propositional logic, propositions, logical operators, truth tables and conditional statements. It provides the course code, lecturer details, lecture outline, objectives and outcomes, and defines key logical terms and concepts. Examples are also given to illustrate propositional logic operators like negation, conjunction, disjunction and exclusive or.

Uploaded by

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

1

Propositional Logic
Course Code: CSC 1204 Course Title: Discrete Mathematics

Dept. of Computer Science


Faculty of Science and Technology

Lecturer 1b Week No: 1 Semester 23-24


No: : Spring
Asst. Prof: Nuzhat Tabassum [email protected]
2

Lecture Outline

1.1 Propositional Logic


• Logic
• Propositional Logic
• Propositions
• Propositional Variables
• Compound Propositions
• Logical Operators
• Truth Value & Truth Table
• Truth Tables of Compound Propositions
• Conditional Statements
• Logic and Bit Operations
3

Objectives and Outcomes

• Objectives: To understand the importance of logic in


mathematical reasoning, to understand proposition and
propositional logic, symbol and usage of different types of
logical operators.
• Outcomes: Students are expected to be able to apply logical
operators and analyze logical propositions via truth tables, be
able to construct a truth table for a given compound
proposition.
4

Key Terms

• Logic: Logic is the discipline that deals with the


methods of reasoning.
• Logic is the basis of all mathematical reasoning
• The rules of logic specify the meaning of mathematical statements

• Propositional Logic: The area of logic that deals with


propositions is called the propositional logic.
5

Key Terms

▪ Proposition: A proposition is a declarative statement


that’s either TRUE or FALSE, but not both.

▪ Statements that are not propositions include


• questions
• Commands
Key Terms
▪ Propositional variable: A variable that represents a proposition.
The conventional letters used for propositional variables are p, q,
r, s, t,..
▪ Compound proposition: A proposition constructed by
combining two or more propositions using logical operators
(AKA : logical connectives)
▪ Logical Operators: Operators used to combine propositions
▪ Truth Value: The truth value of a proposition is true, denoted by
T, if it is a true statement and false, denoted by F, if it is a false
statement. Truth Value ==> Either True or False
▪ Truth Table: A table displaying the truth values of propositions.
7

Proposition: Examples

Proposition Not Proposition

3 + 2 = 32 Bring me coffee!

3+2=5 3+2

CSC 1204 is Khalid’s CSC 1204 is her favorite


favorite class class

Every cow has four legs Do you like Cake?


8

Logical Operators

• Logical Operators ==> unary, binary


• Unary:
• Negation
• Binary
• Conjunction
• Disjunction
• Exclusive OR
• Conditional/Implication
• Biconditional
Logical Operators: Symbols & Usage

Operator Symbol Usage


Negation ¬ NOT
Conjunction ∧ AND
Disjunction ∨ OR
Exclusive or ⊕ XOR
Conditional → if, then
Biconditional ↔ iff
Propositional Logic : Negation
11

Truth table for Negation of a Proposition


12

Propositional Logic : Negation

• Negation just turns a false proposition to true and


the opposite for a true proposition.

• Example1: P: I am going to town


¬ P: I am not going to town; or,
It is not the case that I am going to town
• Example2: p : “23 = 15 +7”
p happens to be false, so ¬ p is true.
13

Conjunction

• Let p and q be propositions. The conjunction of p and


q, denoted by p ∧ q, is the proposition “p and q.”
• The conjunction p ∧ q is true when both p and q are
true and is false otherwise.
• Conjunction corresponds to English “AND”.

• Example: Liana is curious AND clever.


14

Truth Table for Conjunction


15

Conjunction: Example

• Example: p : ‘I am going to town’


q : ‘It is going to rain’

p ∧ q: ‘I am going to town, and it is going to rain.’

• Note: Both p and q must be true to p ∧ q be true


16

Disjunction

• Let p and q be propositions.


• The disjunction of p and q, denoted by p ∨ q, is the
proposition “p or q.”
• The disjunction p ∨ q is false when both p and q are
false and is true otherwise.
• Disjunction is true when at least one of the
components is true.
• Disjunction corresponds to English “OR”.
• Example: Abdullah is brave OR intelligent.
17

Truth Table for Disjunction


18

Examples of Conjunction & Disjunction

Let,
p:5<9
q : 9 < 7.
Construct the propositions p ∧ q and p ∨ q.

Solution:
▪ The conjunction of the propositions p and q is the proposition
p ∧ q : 5 < 9 and 9 < 7
▪ The disjunction of the propositions p and q is the proposition
p ∨ q : 5 < 9 or 9 < 7

Question: What are the truth values of p ∧ q and p ∨ q?


19

Exclusive Or

• Let p and q be propositions.


• The exclusive or of p and q, denoted by p ⊕ q, is the
proposition that is true when exactly one of p and q is
true and is false otherwise.
20

Truth Table of Exclusive Or


Books

• Discrete Mathematics and its applications with combinatorics


and graph theory (7th edition) by Kenneth H. Rosen [Indian
Adaptation by KAMALA KRITHIVASAN], published by
McGraw-Hill
References

1. Discrete Mathematics, Richard Johnsonbaugh, Pearson education, Inc.


2. Discrete Mathematical Structures, Bernard Kolman, Robert C. Busby,
Sharon Ross, Prentice-Hall, Inc.
3. SCHAUM’S outlines Discrete Mathematics(2nd edition), by Seymour
Lipschutz, Marc Lipson

You might also like