COLLEGE: TECHNO INTERNATIONAL NEWTOWN

TECHNICAL REPORT WRITING ON MATH FOR CA-2

EXAMINATION

NAME: SHREYASI CHATTOPADHYAY

STUDENT ID: 2218726035

STREAM: MASTERS IN COMPUTER APPLICATION

YEAR: 1ST

SEMESTER: 1ST

TOPIC: PROPOSTIONAL LOGIC

SUBJECT NAME: DISCRETE MATHEMATICS AND

COMBINATORICS

SUBJECT CODE: MCAN-104

DATE OF SUBMISSION: 22.11.2022

CONTENT:

INTRODUCTION
ABSTRACT
ANALYSIS
CONCLUSION
REFERENCE
 INTRODUCTION

It is important to know the cases in which the articulations are either Obvious or Misleading. We
request it as reality values from such articulations. We likewise examine the genuine worth of
evaluated explanations, which are utilized for the intelligent quantifiers "for each" and "there exists".
A suggestion might be an explanatory sentence that is either obvious or misleading, yet all at once
not both. Many recommendations are composite, that is to say, made out of sub suggestions, such
composite recommendations are called compound recommendations. A recommendation is professed
to be crude in the event that it can't be separated into less complex suggestions, that is in the event
that it isn't composite. For instance, on the off chance that somebody pronounces mumbai is in India
or mumbai has bollywood , perhaps a compound recommendation with sub-suggestions "mumbai is
in India" and "mumbai has bollywood". All things considered, there are three essential legitimate
tasks of combination, disjunction, and invalidation which compare to "and", "or", and "not".
Any two suggestions joined by "and" or "or" to frame a compound recommendation is called
combination and disjunction.
A few suggestions contain just T in the last segment of their reality tables or, all in all, they are valid
for any reality upsides of their factors. Such suggestions are called redundancies and comparably a
recommendation is known as a logical inconsistency in the event that it just holds back F in the last
segment of its reality table or, at the end of the day, in the event that it is bogus for any reality
upsides of its factors. From that point onward, we will be aware of sensible comparability where
when there are two suggestions and it is supposed to be consistently same, or just same or equivalent.
We will get to be aware of the restrictive and biconditional explanations where on the off chance that
the condition is as "on the off chance that p q", such articulations will be expressed as contingent
proclamations and it signified as p → q while assuming it is as "p on the off chance that and
provided that q", such proclamations will be expressed as biconditional explanations and it is meant
as p↔q.
ABSTRACT
In the software engineering field, propositional logic has a wide assortment of uses and subsequently
is vital. It is utilized in framework particulars, circuit planning, coherent riddles, and so on. Aside
from this, it can likewise be utilized in making an interpretation of English sentences to numerical
explanations as well as the other way around.
ANALYSIS
 Conjunction, � ∧ �
here, � ∧ � and take as “p and q”
The truth table of � ∧ �
Truth table
First line showing , if p is true and q is true, then � ∧ � true. second line
shows , if p is true and q is false then � ∧ � is false . here is four lines p q �∧�

communicate to the four possible combinations of T and F for the two T T T

sub-propositions p and q. so � ∧ � is true only that time when both p and
T F F
q are true.
F T F
 Disjunction, � ∨ �
F F F
here, � ∨ � and take as “p or q”
the truth table, � ∧ � rely upon at most on the truth values of p and q as given here.

Truth table

p q �∨�

T T T

T F T

F T T

F F F
 Negation,¬�
Here , ¬� and read as “not p”
if p is true, then ¬� is false and if p is false then ¬� true Truth table
truth value of ¬� may be defined identical by the table. the truth value of
p ¬�
the negation of p will always opposite of the truth table value of p.
T F

 Tautologies and contradictions F T

The proposition “p or not p”, that is, � ∨ ¬� is a tautology, and the
proposition “p and not p”, that is, � ∧ ¬� is a contradiction.
 Truth table Truth table

� ¬� � ∨ ¬� � ¬� � ∧ ¬�

T F T T F F

F T T F T F

fig (x) fig (y)

truth tables have two rows since each proposition has only the one variable p.
Negation of tautology is contradiction since its always false, and the negation of
contradiction is a tautology since its always true.
 LOGICAL EQUIVALENCE
Contemplate the statement
“It is not the case that pinky is pink and sky is blue”
The statement can be written in the form ¬(� ∨ �) where:
o P is “pinky and pink” and q is “sky is blue”

However, as noted above, ¬ � ∨ � ≡ ¬� ∨ ¬� . Thus, the statement

o “pinky is not pink, or sky is not blue”

same meaning as the given statement.

Thus, the truth table is: -

� q � ∧ � ¬(� ∧ �) � q ¬� ¬� ¬� ∨ ¬�
� T T T F T T F F F
T F F T T F F T T
F T F T F T T F T
F F F T F F T T T

Conditional and biconditional statements

truth values of p → q and � ↔ � are defined by the tables
(a) The conditional p → q is false only when the 1st part p true and the 2nd part q is false.
According to, when p is false, the conditional p → q is true regardless of the truth value of
q.
 (b) The biconditional � ↔ � is true when p and q have the same truth values and false
elseways , truth table of the proposition ¬� ∨ � arrives in Fig 1. detect the truth tables of
¬� ∨ � and p → q are same, that is, they both are false in the 2nd case. Accordingly, p →
q is logically equivalent to ¬� ∨ � ,
� ↔ � ≡ ¬� ∨ � ,

� � p→q � � �↔� � � ¬� ¬� ∨ �

T T T T T T T T F T

T F F T F F T F F F

F T T F T F F T T T

F F T F F T F F T T
CONCLUSION

Propositional logic assumes a significant part in software engineering as well as in an individual's

day to day routine. The primary advantages of examining and utilizing propositional logic are that it
keeps us from going with conflicting deductions and rash choices. It consolidates thinking and
abilities to think in one's everyday existence.

REFERENCE
Discrete Mathematics by T VEERARAJAN