Scribd
Upload
84 views22 pages

Propositional Logic Connectives Guide

The document discusses various logical connectives used in propositional logic: negation (¬), conjunction (∧), disjunction (∨), conditional/implication (→), and biconditional (⇔). It provides the truth tables for each connective. It also discusses the converse, contrapositive, and inverse of statements p and q, and provides a truth table comparing these logical relationships.

Uploaded by

soumyasahoo8125
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
84 views22 pages

Propositional Logic Connectives Guide

The document discusses various logical connectives used in propositional logic: negation (¬), conjunction (∧), disjunction (∨), conditional/implication (→), and biconditional (⇔). It provides the truth tables for each connective. It also discusses the converse, contrapositive, and inverse of statements p and q, and provides a truth table comparing these logical relationships.

Uploaded by

soumyasahoo8125
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

DISCRETE

MATHEMATIC
S
PROJECT-1
NAME- SANJANA PATRO
REGD.NO:- 220301120016
BRANCH- B.TECH (CSE)
CONNECTIVES:-
In propositional logic generally we use five
connectives which are -
1. NEGATION/NOT (¬)
2. CONJUNCTION/AND (∧)
3. DISJUNCTION/OR(∨)
4. CONDITIONAL/IMPLICATION(→)
5. BICONDITIONAL/DOUBLE IMPLICATION (⇔)
NEGATION
The negation of a proposition p (i.e., not p) is denoted by
¬p.
It takes the opposite value of the proposition p or q. The
truth table is as follows −
p ¬p

True False

False True
CONJUCTION (∧) :-
• If ‘p and q’ are two propositions then the conjunction of p and
q (denoted by p л q)
• The truth table is as follows −

p q p∧q

True True True

True False False

False True False

False False False


DISJUNCTION(∨)
The OR operation of a propositions p and q
(written as p∨q ) is true if at least any of the
proposition either p or q is true.
The truth table is as follows -

p q p∨q
True True True

True False True

False True True

False False False


CONDITIONAL/ )
IMPLICATION(→
An implication p → q is the proposition “if p, then q”.
It is false if p is true and q is false. The rest cases are true.
The truth table is as follows −

p q p→q
True True True

True False False

False True True

False False True


BICONDITIONAL(⇔):-
 If p and q are two propositions then the biconditional
statement of p and q denoted by p ⇔ q is the proposition
“p if and only if q”
 It takes the value true if p and q both have same truth
values.
 The truth table is as follows :-
p q p⇔q
True True True

True False False

False True False

False False True


CONVERSE, CONTRAPOSITIVE, AND
INVERSE OF TWO STATEMENTS p AND
q
CONVERSE:- The converse of a conditional statement
p→q is defined as the compound proposition q→p.

CONTRAPOSITIVE:- The contrapositive of p→q is


defined as the compound proposition ¬q → ¬p.

INVERSE:- The inverse of a statement p→q is defined as


the compound proposition ¬p → ¬q.
TABLE FOR CONVERSE, INVERSE
AND CONTRAPOSITIVE
STATEMENTS
p q ¬p ¬q p→q q→p ¬p→¬q ¬q→¬p

T T F F T T T T

T F F T F T T F

F T T F T F F T

F F T T T T T T

You might also like