University Of SALAHADDIN – Erbil

College Of ENGINEERING
.SOFTWARE & INFORMATICS Dep

STATEMENT
Prepared: Supervised:
Nwa Dler SALAR Atrooshi

Dlvin Osman
Biza Kamal
 CONTENTS
• PROPOSETIONAL STATEMENT

• IMPLICATION (CONDITIONAL)

• CONVERSE AND CONTRA POSITIVE

• BICONDITIONAL STATEMENT

• LAWS OF ALGEBRA OF PROPOSITIONS

• Universal and Existential Quantifiers

• REFERENCES
 PROPOSETIONAL STATEMENT
Is a Sentence Which Is Either True Or False.
A Propositional Statement is One Of:

 -A Simple Proposition

 Denoted By A Capital Letter, For Example: P

 Or (A) Negation

 Example: ~A : “Not A”
 -Two Propositional Function
 A˄B : “ A and B”
 A˅B : “A or B”
 If a Connective Joins Complex Statement, Parentheses Are Added

 A˄(B˅C)
 TRUTH TABLE
* The Truth Value Of a Compound Propositional Statement Is Determined By

Its Truth Table.

* Truth Table Define the Truth Value Of a Connective For Every Possible Truth

Value Of

Forms.

* And Also Represent a Relationship between the Truth Values of Propositions

NOTE:
If all result in truth table was true the statement is (TAUTOLOGY)

if all was false so it is (CONTRADICTION)

if it was neither is (CONTINGENCY)

 LOGICAL CONNECTIVES
* Logical Negation:
Giving Any Proposition P, another Proposition Is Called the Negation of P,

By Inserting In P Word “NOT” Denoted By ~P

The Truth Value Of ~P Depends On The Truth Value Of P, If It’s True Then

~P Is False , And If P Is False Then ~P Is True.

P ~P

T F

F T
 LOGICAL CONNECTIVES
* Conjunction: (P˄Q)
Any Two Propositions Can Be Combined By The Word “And” To Form A

Compound Proposition Called The Conjunction Of The Original

Propositions,

Symbolically: (P˄Q)

P Q P˄Q
T T T
T F F
F T F
F F F
 LOGICAL CONNECTIVES
* Disjunction: (P˅Q)
Any Two Propositions Can Be Combined By the Word “Or” To Form a

Compound Proposition Called the “Disjunction” Of the Original

Propositions

Symbolically: P˅Q
P Q P˅Q

T T T

T F T

F T T

F F F
 IMPLICATION
(CONDITIONAL)
* An implication or conditional is a molecular statement of the form

Q→P

Where P and Q are statement we say that:-

P is the Hypothesis

Q is the Conclusion

An implication is true if P was false and Q was true or both, The only way for

an implication is false if P was true and Q was false.

The truth value of implication is determined by the truth value of two parts

(hypothesis and conclusion).

 IMPLICATION (CONT.)
FOR EXAMPLE:

If SARA gets 90 on the final, then SARA will pass the class

Let P is the statement (SARA gets 90 on final)

And Q is the statement (SARA will pass the class).

P→Q Q P

T T T

F F T

T T F

T F F
 IMPLICATION (CONT.)
* CONVERSE AND CONTRA POSITIVE.
+ The converse of an implication P → Q is the implication Q → P

- the converse is not logically equivalent to the original implication.

+ Q → P the Contra Positive of an implication is (┌Q → ┌P)

- An implication and its contra positive are logically equivalent

(they are either both true Or both false).

 BICONDITIONAL STATEMENT
* P↔Q Let P and Q two statement .then the result is that the truth

of either one of the connected statement requires the truth of the other.

Either both statements are true, or both statements are false.

(P ↔ Q) Is logically equivalent to (P → Q) ˄ (Q → P)

You can think of "if and only if" statement as having two parts. An

implication and its converse we might say one is the "if" part and other

part is "if only".

 BICONDITIONAL (CONT.)
* P↔Q Let P and Q two statement .then the result is that the truth

of either one of the connected statement requires the truth of the other.

Either both statements are true, or both statements are false.

(P ↔ Q) Is logically equivalent to (P → Q) ˄ (Q → P)

P↔Q Q P

T T T

F F T

F T F

T F F
 LAWS OF ALGEBRA
* ASSOCIATIVE LAW:
It says that it doesn't matter how we group the numbers.

 when we add (or): p V (q V r) ≡ (p V q) V r

 when we multiply (and):p Λ (q Λ r) ≡ (p Λ q) Λ r

* COMMUTATIVE LAWS:
It says we can swap numbers over and still get the same answer.

 when we add: a+b=b+a

 when we multiply: a × b = b × a
 LAWS OF ALGEBRA
* DISTRIBUTIVE LAW:
Adding numbers and then multiplying them yields the same result as

multiplying numbers and then adding them.

 P Λ (Q V R) ≡ (P Λ Q) V (P Λ R)
 P V (Q Λ R) ≡ (P V Q) Λ (P V R)

* IDENTITY LAW:
if you AND P*True, or OR false+P every time you get P as a result.

PV F≡ P
PΛ T≡ P
 LAWS OF ALGEBRA
* DOUBLE NEGATION: ~(~p) ≡ p

* IDEMPOTENT LAW:
if you AND P with itself, or OR P with P so the answer will be P

 P V P≡ P
 P Λ P≡ P
* NEGATION LAW OR (COMPLEMENT LAW):

if we And a statement with its negation the answer is(False)

 P V ~P ≡ T
 P Λ ~P ≡ F
 LAWS OF ALGEBRA
* ABSORPTION LAW:

The Law appearing in the definition of Boolean algebras and lattice

which states that. for binary operators and (which most commonly are

logical OR and logical AND). The two parts of the absorption law are

sometimes called the "absorption identities”.

• operators must be different.

• Term outside must also be inside.

 P V (P Λ Q) ≡ P

 P Λ (P V Q) ≡ P
 QUANTIFIERS
* EXISTENTIAL QUANTIFIER

is (∃) and is read "there exists" or "there is".

For example:

∃X (X < 0)
Assert that there is a number less than 0.
 QUANTIFIERS
* UNIVERSAL QUANTIFIER

Is (∀) and it is read "for all" or "every"

For example:

∀X (X ≥ 0)
Assert that every number is greater than or equal to 0.
 QUANTIFIERS AND
NEGATION
* ∀~x, P(x) is equivalent to ∃x, ~P(x)

* ∃~x, P(x) is equivalent to ∀x, ~P(x)

Essentially, we can pass the negation symbol over the quantifier but the

causes the quantifier to switch type .this should not be surprised: if not

everything has a property. Then something doesn’t have that property.

And if there is not something with

a property, them everything doesn’t have that property.

THANK
YOU!
 REFERENCES
 DISCRETE MATHMATICS {SEYMOUR LIPSCHUTZ-MARC LIPSON}

 DISCRET MATHMATICS: ELEMENTARY AND BEYOND.

 DISCRETE MATHMATICS AND IT’S APPLICATIONS

 http://discretetext.oscarlevin.com/dmoi/sec_intro-statements.html

 https://people.cs.clemson.edu/~pargas/courses/cs207/fall2014/hand

outs/02_PropLogicPrfs-DNFCombined.handout.pdf

 https://en.wikipedia.org/wiki/Absorption_law

 https://

math.stackexchange.com/questions/2050571/im-trying-to-learn-and-understand-how-to-simplify-a-pro

position-using-the-laws