Scribd
Upload
13 views

Propositional Logic

Uploaded by

debanjan.gupta1994
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Propositional Logic

Uploaded by

debanjan.gupta1994
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

© Copyright Reserved by Debanjan Gupta

PROPOSITIONAL LOGIC

A valid reasoning that enables us to draw conclusions is known as Logic.


There are various ways to provide a logic. It can be done through thoughts, signals,
impressions, statements, etc. The logic endeavoured through sentences is termed as
Propositional Logic
PROPOSITION:
A sentence from which a conclusion can be drawn in terms of true and false is known as a
proposition

Sr. No Statements Conclusion


1 Is it cold today? True/False
2 Apples are red True/False
3 What is your name? Cannot be True/False

PROPOSITIONAL CONSTANTS AND VARIABLES


A propositional constant is a sentential form of statements that results either in True or
False. Propositional variable is the symbolic representation of a propositional constant.
Ex: a: “Today is Saturday.”
The proposition “Today is Saturday” is a propositional constant that can be concluded as
True or False. ‘a’ is the symbolic representation of the proposition. Now, whenever, ‘a’ is
used in the logic it will denote “today is Saturday”. Hence it is a propositional variable.
Types of Propositions
a. Simple Proposition:
A proposition that is represented in simple sentence is called Simple Proposition.
Ex: It is raining today.
: Milk is liquid.

b. Compound Proposition:
If two or more simple propositions are joined together with the help of some
connecting words, then the resulting proposition is known as Compound
Proposition.
Ex: a:” Bengaluru is the capital of Karnataka.”
b:” It is Situated in Southern India.”
Here, ‘a’ and ‘b’ are simple propositions which can be joined by using a connecting
word ‘and’, and so a ‘and’ b will become “Bengaluru is the capital of Karnataka and
it is situated in southern India”.
© Copyright Reserved by Debanjan Gupta

CONNECTIVES:
The connecting words/Symbols to join two simple propositions are known as Connectives.
1. Conjunction (. or ^)
It results in True, if all statements are True, otherwise False.
Truth Table:
a b (a^b)
0 0 0
0 1 0
1 0 0
1 1 1

2. Disjunctions (+ or v)
It results in True, if any statement is True, and results in false if all statements are
false.
Truth Table:
a b (avb)
0 0 0
0 1 1
1 0 1
1 1 1

3. Negation ( ‘ or ˜)
Negation does not actually join any simple proposition; it generally turns the True
to False and False to True
a a'
0 1
1 0

Double Negation:
A double Negation of a proposition will always result in the same proposition.
((a)’)’ = a

a a' (a’)’
0 1 0
1 0 1
© Copyright Reserved by Debanjan Gupta

4. Implication/Conditional ( ->)
If one argument is True, then the other argument is also True. It is expressed as:
Ex: a -> b = a’ + b
a b a -> b
(a’+b)
0 0 1
0 1 1
1 0 0
1 1 1

5. Equivalence/ Biconditional (<->)


It means ‘if and only if’, it will be True only if corresponding values of all
proposition statements are True.
it is expressed as:
Ex: a <-> b = a’b’ + ab
a b a <-> b
(a’.b’+ a.b)
0 0 1
0 1 0
1 0 0
1 1 1

ANTECEDENT AND CONSEQUENT:


In a conditional proposition a->b, ‘a’ is the antecedent and ‘b’ is the consequent. The
component which is represented by the ‘if’ is the antecedent and the component that
follows is known as consequent.
Ex: a: ‘Its cold today.’
b: ‘You cannot go out.’
Then a->b means, “If its cold today then you cannot go out.” Here, the first part is
antecedent and the next part is consequent.

CONVERSE, INVERSE AND CONTRAPOSITIVE:


Converse: the conditional statement obtained after interchanging the antecedent and
consequent is called converse.
© Copyright Reserved by Debanjan Gupta

Ex: if 5 is prime number, then it will only have two factors.


Converse: If 5 has only two factors then it is a prime number.

Inverse: The inverse of a given conditional statement is a new conditional statement whose
antecedent and consequent are the negation of the original statement.
Ex: If it rains then the sky is cloudy.
Inverse: If it does not rain then the sky is not cloudy.

Contrapositive: A new conditional statement obtained whose antecedent is the negation of


the consequent and consequent is the negative antecedent of the original statement.
Ex: If it rains then the sky is cloudy.
Contrapositive: If the sky is clear then it does not rain.

TAUTOLOGY AND CONTRADICTION:


If the outcome of a Truth table contains only 1’s then it is termed as a Tautology, while if the
outcome a Truth Table contains only 0s then it is called Contradiction. However, if the
outcome of a Truth Table contains both 0’s and 1’s is called Contingency.

SOLVED EXAMPLES:
1. Show that the expression (p ^ ( p v q)) is equal to p
solution:
p q pvq p ^ ( p v q)
0 0 0 0
0 1 1 0
1 0 1 1
1 1 1 1

Thus, (p ^ ( p v q)) = p
© Copyright Reserved by Debanjan Gupta

2. Verify: ( p’ -> q ) ^ p = ( p ^ q’ ) v ( p ^ q )
solution:
p q P’ - > q (p’->q) ^p p^q’ p^q ( p ^ q’ )
v(p^q)
0 0 0 0 0 0 0
0 1 1 0 0 0 0
1 0 1 1 1 0 1
1 1 1 1 1 1 1

Therefore, Verified Successfully

You might also like