Scribd
Upload
102 views6 pages

Adv Engg Math Lesson #1

The document discusses key concepts in discrete mathematics including propositions, truth tables, logical connectives, and propositional logic. Propositions are statements that can be either true or false. Truth tables are used to determine the truth values of compound propositions using logical connectives like conjunction, disjunction, negation, implication, bi-conditional, etc. Examples are provided to illustrate tautologies, contradictions and contingent statements.

Uploaded by

Anand Javier
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
102 views6 pages

Adv Engg Math Lesson #1

The document discusses key concepts in discrete mathematics including propositions, truth tables, logical connectives, and propositional logic. Propositions are statements that can be either true or false. Truth tables are used to determine the truth values of compound propositions using logical connectives like conjunction, disjunction, negation, implication, bi-conditional, etc. Examples are provided to illustrate tautologies, contradictions and contingent statements.

Uploaded by

Anand Javier
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/ 6

Advanced Engineering Mathematics for ECE

Instructor: Engr. Paulina A. Marzan

LESSON #1: Discrete Mathematics


DEFINITION:

PROPOSITION is a sentence which is either true or false, but not both, usually denoted by a variable
using alphabetical symbols and expressed as a declarative sentence.

Example Propositions:

1. 2 is an even number
2. The sun revolves around the earth
3. What time is it? (Not a proposition )
4. Go to bed! (Not a proposition)

Propositions are normally expressed as declarative in form.

COMPOUND PROPOSITIONS – combination of two or more propositions as one.

Given the propositions P and Q, the

Conjunction of P and Q, denoted P∧Q, is the proposition “P and Q”. P∧Q is true exactly
when both P and Q are true.

Truth Table

P Q P∧Q
false false false
false true false
true false false
true true true

Example: Consider the following statements

P: 6 is an even integer
Q: 5 is an odd integer

The conjunction of these propositions, P∧Q, is the proposition

“6 is an even integer and 5 is an odd integer”


Disjunction of P and Q, denoted P∨Q, is the proposition “P or Q”. P∨Q is true exactly when at least
one P or Q is true.

Truth Table

P Q P∨Q
false false false
false true true
true false true
true true true

Example: Consider the following statements

P: 6 is an even integer
Q: 5 is an odd integer

The disjunction of these propositions, P∨Q, is the proposition

“6 is an even integer or 5 is an odd integer”

Negation of P, denoted ¬P, is the proposition “not P”. ¬P is true exactly when P is false.

Truth Table

P ¬P
false true
true false

Example: Consider the following statement

P: 6 is an even integer

The negation of this proposition, ¬P, is the proposition

“6 is not an even integer”

or

“It is not the case that 6 is an integer”

*** Truth Table – it is a tabular representation of the summary of the truth values of a proposition.
EXAMPLES:

Make a truth table for each of the following propositions:

1. (P ∨ (¬Q))

Ans.:

Truth Table
P Q ¬Q (P ∨ (¬Q))
False false true true
False true false false
True false true true
True true false true

2. (P ∨ (¬Q)) ∧ (¬R)

Ans.:

Truth Table
P Q R ¬Q ¬R P˅ (¬Q) (P˅(¬Q)) ˄ (¬R)
False False False True True True True
False False True True False True False
False True False False True False False
False True True False False False False
True False False True True True True
True False True True False True False
True True False False True True True
True True True False False True False
Implication
Definition

The proposition ‘If P, then Q’ is called an implication. We will often write it symbolically as P → Q.

P Q P→Q
false false True
false true True
true false False
true true True

Converse, Contra-positive, Inverse


The proposition q→p is called the converse of p→q
The proposition ¬q→¬p is called the contra-positive of p→q
The proposition ¬p→¬q is called the inverse of p→q

Bi-conditional

Definition

Let p and q be propositions. The bi-conditional p↔q is the proposition that is true when p and q
have the same truth values, and is false otherwise. p↔q is read as p if and only if q.

p q p↔q
false false True
false true False
true false False
true true True

Example: Consider the following statements

p: 6 is an even integer
q: 5 is an odd integer

The bi-conditional proposition, p↔q, is the proposition

“6 is an even integer if and only if 5 is an odd integer”


Tautology, Contradiction, Contingency

Definitions

A tautologuous statement is one which has only the decision value of true
A contradictory statement is one which is always false
A contingent statement is neither a tautology or a contradictory

Examples: Show that the following are tautology, contradictory, and contingent statements

1. p ∨ ¬p
2. p ˄ ¬p
3. p →¬p

Solution:

1.
p ¬p p ∨ ¬p
false true true
true false true

The proposition p ∨ ¬p is Tautology (all results are true)

2.
p ¬p p ˄ ¬p
false true false
true false false

The proposition p ˄ ¬p is contradiction (all results are false)

3.
p ¬p p → ¬p
false true true
true false false
The proposition p → ¬p is contingency

You might also like