MTH202 Midterm Short Notes Set 2

کے دوستوں اپنے کو سائٹ · LINK: · WEBSITE LINK: · IMPORTANT NOTE

You should never copy paste the same answer which we are providing. Please do make some changes in the solution file. If you appreciate our

work, please share our website with your · friends. · Mth202 Short Notes Mid term · Lec 1 to22

argument.

What is SIMPLE STATEMENT?

A statement is a declarative sentence that is either true or false but not both. A statement is also referred to as a proposition.

Define Logical Connective?

There are five logical connectives

predicate logics in such a manner that resultant logic depends only on the input logics and the meaning of the connective used. Generally there are five connectives which are − OR (∨) AND

SYMBOLIC REPRESENTATION

EXAMPLE

SENTENCE SYMBOLIC FORM

1. It is not hot. ~ p

A Logical Connective is a symbol which is used to connect two or more propositional or Lecture No.1 Logic

What is Discrete Mathematics?

Discrete Mathematics concerns processes that consist of a sequence of individual steps.

Define LOGIC:

Logic is the study of the principles and methods that distinguish between a valid and an invalid

CONNECTIVE · MEANINGS · SYMBOLS · CALLED

Negation not Tilde Conjunction And/but Hat Disjunction or Vel If…then… Arrow if and only if Double arrow

2. It is hot and sunny. P ∧q
3. It is hot or sunny. P ∨ q
4. It is not hot but sunny. ~ P ∧q
5. It is neither hot nor sunny. ~ P ∧ ~ q

If p is a statement variable, then negation of p, “not p”, is denoted as “~p”

TRUTH TABLE FOR ~ p

Define CONJUNCTION (∧)?

If p and q are statements, then the conjunction of p and q is “p and q”, denoted as “p ∧ q”.

TRUTH TABLE FOR p ∧ q.

What is DISJUNCTION (∨) or INCLUSIVE OR?

If p & q are statements, then the disjunction of p and q is “p or q”, denoted as “p ∨ q”.

TRUTH TABLE FOR p ∨ q Define Truth Table?

A truth table specifies the truth value of a compound proposition for all possible truth values of its constituent propositions.

Define NEGATION (~)?

p ~ p

T F

F T

p q p ∧ q T T T T F F F T F F F F

p q p v q

T T T

T F T

F T T

F F F