Scribd
Upload
72 views16 pages

Chap1 Logics Part I

This document covers the key concepts in the first chapter of discrete mathematics including propositions, logic, and truth tables. It defines propositions as statements that can be determined true or false. Various connectives like conjunction, disjunction, negation and their truth tables are explained. Examples are provided to illustrate logical equivalence and compound statements formed using connectives. The objectives are to understand propositions and use truth tables to determine logical equivalence of compound statements. Homework questions from the chapter are also listed.

Uploaded by

MCENA30
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
72 views16 pages

Chap1 Logics Part I

This document covers the key concepts in the first chapter of discrete mathematics including propositions, logic, and truth tables. It defines propositions as statements that can be determined true or false. Various connectives like conjunction, disjunction, negation and their truth tables are explained. Examples are provided to illustrate logical equivalence and compound statements formed using connectives. The objectives are to understand propositions and use truth tables to determine logical equivalence of compound statements. Homework questions from the chapter are also listed.

Uploaded by

MCENA30
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/ 16

Discrete Mathematics

Chapter 1
The Foundations: Logic and proofs
1

Objectives:
To grasp the concept of propositions.
To determine whether two compound
propositions are logically equivalence
using truth table.

Logic
Logic = the study of correct reasoning
Use of logic

In mathematics:

to prove theorems

In computer science:

to prove that programs do what they are


supposed to do

Section 1.1 Propositions


A proposition is a statement or sentence
that can be determined to be either true or
false (not both) and declarative.
Examples:

John is a programmer" is a proposition


I wish I were wise.is it a proposition??
What time is it?.is it a proposition??
X + 1 = 2 ..is it a proposition??
X + Y = Z ...is it a proposition??
4

Connectives
If p and q are propositions, new compound
propositions can be formed by using
connectives
Most common connectives:

Conjunction AND.
Inclusive disjunction OR
Exclusive disjunction OR
Negation
Implication
Double implication

Symbol ^
Symbol v
Symbol v
Symbol ~
Symbol
Symbol
5

Truth table of conjunction


The truth values of compound propositions
can be described by truth tables.
Truth table of conjunction

p
T

q
T

p^q
T

T
F
F

F
T
F

F
F
F

p ^ q is true only when both p and q are true.


6

Example
Let p = Tigers are wild animals
Let q = Chicago is the capital of Illinois
p ^ q = "Tigers are wild animals and
Chicago is the capital of Illinois"
p ^ q is false. Why?

Truth table of disjunction

The truth table of (inclusive) disjunction is


p
T

q
T

pvq
T

T
F
F

F
T
F

T
T
F

p q is false only when both p and q are false

Example: p = "John is a programmer", q = "Mary is a lawyer"


p v q = "John is a programmer or Mary is a lawyer"
8

Exclusive disjunction

Either p or q (but not both), in symbols p q


p
T

q
T

pvq
F

T
F
F

F
T
F

T
T
F

p q is true only when p is true and q is false,


or p is false and q is true.

Example: p = "John is programmer, q = "Mary is a lawyer"


p v q = "Either John is a programmer or Mary is a lawyer"
9

Negation

Negation of p: in symbols ~p
p

~p

~p is false when p is true, ~p is true when p is


false

Example: p = "John is a programmer"


~p = "It is not true that John is a programmer"
10

Conditional Statement

Let p and q be propositions. The conditional


statement p q is if p,.. then q.
p
T
T
F
F

q
T
F
T
F

pq
T
F
T
T

p q is false when p is true and q is false,


and true otherwise.

Example: p = Peter learns discrete mathematics, q = Peter will find


a good job"
11

pq=?

Bi-Conditional Statement

Let p and q be propositions. The biconditional


statement p q is p if and only if q.
p
T
T
F
F

q
T
F
T
F

q
T
F
F
T

p
q is true when p and q have the same
truth values, and if false otherwise.

Example: p = You can take the flight, q = You buy a ticket"

q=?

12

Compound Statements
Let p, q, r be simple statements
We can form other compound statements,
such as

(pq)^r
p(q^r)
(~p)(~q)
(pq)^(~r)
and many others
13

Example: truth table of (pq)^r


p

(p q) ^ r

F
14

Summary
Propositions
Logically equivalence
Truth table for conjunction/AND,
disjunction/OR, Negation/NOT, and
Exclusive disjunction.

15

Homework

Section 1.1
Pg. 12 Questions 2, 4, 8, 15 and 21(c)
& 21(e).

16

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