CSE208 DMS Mod1 L5 Proposition

Amity School of Engineering & Technology (CSE)
Discrete Mathematics
Module I
Lecture-1
Mathematical Logic
ASET(CSE)
1
Module I:
 Proposition,
 Propositional Calculus-
Propositional Variables and
 Compound propositions,
2
1.5 OBJECTIVES
After completing this section, you will be able to
1.5.1 Explain Proposition
1.5.2 Differentiate between simple and compound sentences
1.5.3 Understand basic logical operators
1.5.4 Propositional calculus
1.5.5 Well formed formula(WFF) [A Syntax for Compound

Proposition]
3
Proposition
A Proposition (or sentence) is a declarative

statement whose truth value is either True or
False but not both.
These two values “True” and “False” is denoted by “T” and “F”
respectively. Sometimes it is also denoted by 1 and 0.
4
Proposition…
Proposition (Example) Truth value
1. Two is an even integer. T
2. Delhi is the capital of India. T
3. A triangle has four sides. F
4. 3+4=8 F
5. Washington DC is the capital of the United States T
5
Proposition…
Examples that are NOT propositions Truth value
1. Please wait ! ?
2. How are you? ?
3. x+3=5 ?
4. The sun will shine tomorrow. ?
5. This sentence is false. ?
The area of logic which deals with propositions is called

propositional calculus or propositional logic.
6
Type of Proposition:
Proposition
Simple Compound
 A statement which has no logical connectives (and, or, not etc.) is

called a Simple (atomic) sentences.
For example all the statements in Example1 are all simple statements.
 A statement which is made up of two or more simple statements using

a logical connective (such as “and”, “or”, “Not” , “if..then” or “ if and only
if”) is called a compound statement.
Example: “Two is an even integer” and “Delhi is the capital of India” is a
compound statement
7
Logical connectives:
Given a atomic propositions (denoted by ..).
To form the compound propositions, the following logical
connectives are used.
Symbol Meaning Example In words Precedence
Negation 1
Disjunction 2
Conjunction 3
Implication 4
(conditional)
Equivalence 5
(Biconditional)
Note :Negation, ￢ p 8
Propositional calculus:
Given a atomic propositions: ,……
Propositional calculus is a language of

propositions ( or a set of rules) used to
combine the atomic propositions to form the
compound propositions using the logical
connectives ().
9
Propositional calculus(WFF)
Well formed formula(WFF) [A Syntax for Compound Proposition]
1. Any statement variable ( is a WFF).
2. If is a WFF, then is also a WFF.
3. If and are WFFs then , and are

also WFFs
4. A WFF can be constructed only by the finite number of applications of

rule (1) to (3) above.
Note: A WFF is nothing but valid strings with statement letters,

connectives and parenthesis.
Example: (Well-formed formula in propositional logic)

F1:
F2:
10
Below are the Examples which may seem like a WFF

but they are not considered as Well-Formed
Formulas:
1.(P), ‘P’ itself alone is considered as a WFF by Rule 1
but placing that inside parenthesis is not considered as
a WFF by any rule.
2.¬P ∧ Q, this can be either (¬P∧Q) or ¬(P∧Q) so we
have ambiguity in this statement and hence it will not
be considered as a WFF. Parentheses are mandatory
to be included in Composite Statements.
11
BNF(Backus-Naur form) grammar of sentences in propositional logic:
12
Summary
 Any declarative statement whose truth value is either True

or False but not both is called a proposition.
 Following statements are not a proposition:
Exclamation mark(!), Question mark(?), expression with variable and
Ambiguous statements.
 WFF is basically a syntax for writing compound proposition
13
14
Practice Questions
15
Construct Truth table of  pq
16
17
18
19
20
Verify that the proposition p ∨ ￢ (p ∧ q) is a tautology.
Construct the truth table of p ∨ ￢ (p ∧ q)

as shown in Fig.
Since the truth value of p ∨ ￢ (p ∧ q) is T
for all values of p and q, the proposition is a
tautology.
21
Question. Show that the propositions ￢ (p ∧ q) and

￢ p ∨ ￢ q are logically equivalent.
Construct the truth tables for ￢ (p ∧ q) and ￢ p ∨ ￢ q
Since the truth tables are the same (both propositions are false in the first case and true
in the other three cases), the propositions ￢ (p ∧ q) and ￢ p ∨ ￢ q are
logically equivalent and we can write
￢ (p ∧ q) ≡ ￢ p ∨ ￢ q.
22
Implication (conditional)
23
Converse, Inverse, Contrapositive
Given an if-then statement "if p , then q ," we can create

three related statements:
A conditional statement consists of two parts, a

hypothesis in the “if” clause and a conclusion in
the “then” clause. For instance, “If it rains, then
they cancel school.”
"It rains" is the hypothesis.
"They cancel school" is the conclusion.
24
25
26
Equivalence (Biconditional)
(p⇒q)∧(q⇒p)
27
28
29
30
Properties of Propositions:
Tautologies, Contradictions, and Contingencies
31
32

CSE208 DMS Mod1 L5 Proposition

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE208 DMS Mod1 L5 Proposition

Uploaded by

Copyright:

Available Formats

Amity School of Engineering & Technology (CSE)

1.5.1 Explain Proposition

1.5.2 Differentiate between simple and compound sentences

1.5.3 Understand basic logical operators

1.5.4 Propositional calculus

1.5.5 Well formed formula(WFF) [A Syntax for Compound

A Proposition (or sentence) is a declarative

1. Two is an even integer. T

2. Delhi is the capital of India. T

3. A triangle has four sides. F

5. Washington DC is the capital of the United States T

2. How are you? ?

4. The sun will shine tomorrow. ?

5. This sentence is false. ?

The area of logic which deals with propositions is called

 A statement which has no logical connectives (and, or, not etc.) is

 A statement which is made up of two or more simple statements using

Symbol Meaning Example In words Precedence

Given a atomic propositions: ,……

Propositional calculus is a language of

1. Any statement variable ( is a WFF).

2. If is a WFF, then is also a WFF.

3. If and are WFFs then , and are

4. A WFF can be constructed only by the finite number of applications of

Note: A WFF is nothing but valid strings with statement letters,

Example: (Well-formed formula in propositional logic)

Below are the Examples which may seem like a WFF

BNF(Backus-Naur form) grammar of sentences in propositional logic:

 Any declarative statement whose truth value is either True

Construct Truth table of  pq

Verify that the proposition p ∨ ￢ (p ∧ q) is a tautology.

Construct the truth table of p ∨ ￢ (p ∧ q)

Question. Show that the propositions ￢ (p ∧ q) and

Construct the truth tables for ￢ (p ∧ q) and ￢ p ∨ ￢ q

Converse, Inverse, Contrapositive

Given an if-then statement "if p , then q ," we can create

A conditional statement consists of two parts, a

You might also like