Trisha Mae C.

Salinas 10-15-20

10-SSP

Assignment

1. What are the truth table?

Answer:
A truth table is a mathematical table used in logic—specifically in
connection with Boolean algebra, boolean functions, and propositional calculus—
which sets out the functional values of logical expressions on each of
their functional arguments, that is, for each combination of values
taken by their logical variables.[1] In particular, truth tables can be
used to show whether a propositional expression is true for all
legitimate input values, that is, logically valid.

I. Truth Table of Logical Negation

The negation of a statement is also a statement with a truth
value that is exactly opposite that of the original statement.
For instance, the negation of the statement is written
symbolically as
~\large{P}P or \large{\neg P}¬P.
~{P}P or {\neg P}¬P is read as “not PP.”

II. Truth Table of Logical Conjunction

A conjunction is a type of compound statement that is
comprised of two propositions (also known as simple
statements) joined by the AND operator.
The symbol that is used to represent the AND or logical
conjunction operator is \color{red}\Large{\wedge} ∧. It looks
like an inverted letter V.
If we have two simple statements PP and QQ, and we want
to form a compound statement joined by the AND operator,
we can write it as:
\large{P \wedge Q}P∧Q.
{P \wedge Q}P∧Q is read as “PP and QQ.”

III. Truth Table of Logical Disjunction

A disjunction is a kind of compound statement that is
composed of two simple statements formed by joining the
statements with the OR operator.
In a disjunction statement, the use of OR is inclusive. That
means “one or the other” or both.

The symbol that is used to represent the OR or logical

∨
disjunction operator is \color{red}\Large{ \vee } . It
resembles the letter V of the alphabet.
Two propositions PP and QQ joined by OR operator to form a
compound statement is written as:
\large{P \vee Q}P∨Q.
{P \vee Q}P∨Q is read as “PP or QQ.”

IV. Truth Table of Logical Implication

An implication (also known as a conditional statement) is
a type of compound statement that is formed by joining two
simple statements with the logical implication connective or
operator.
The symbol that is used to represent the logical implication
operator is an arrow pointing to the right, thus a rightward
arrow.

When two simple statements PP and QQ are joined by the

implication operator, we have:
\Large{P \to Q}P→Q.
 where PP is known as the hypothesis
 where QQ is known as the conclusion

There are many ways how to read the conditional {P \to

Q}P→Q. Below are some of the few common ones.
{P \to Q}P→Q is read as “PP implies QQ“.
{P \to Q}P→Q is read as “If PP then QQ“.
{P \to Q}P→Q is read as “PP only if QQ“.
{P \to Q}P→Q is read as “If PP is sufficient for QQ“.
{P \to Q}P→Q is read as “QQ is necessary for PP“.
{P \to Q}P→Q is read as “QQ follows from PP“.
{P \to Q}P→Q is read as “QQ if PP“.
V. Truth Table of Logical Biconditional or
Double Implication
A double implication (also known as a biconditional
statement) is a type of compound statement that is formed
by joining two simple statements with the biconditional
operator. A biconditional statement is really a combination of
a conditional statement and its converse.
The biconditional operator is denoted by a double-headed
arrow.

When you join two simple

statements (also known as
molecular statements) with
the biconditional operator,
we get:

\Large{P \leftrightarrow Q}P↔Q

{P \leftrightarrow Q}P↔Q is read as “PP if and only if QQ.”
 where PP is known as the antecedent

 where QQ is known as the consequent

2. Rules of truth table

Answer:
I. Truth Table of Logical Negation
Remember: The negation operator denoted by the
symbol ~ or \neg¬ takes the truth value of the original
statement then output the exact opposite of its truth
value. In other words, negation simply reverses the
truth value of a given statement. Thus, if
statement PP is true then the truth value of its negation
 is false. In the same manner if PP is false the truth
value of its negation is true.

II. Truth Table of Logical Conjunction

Remember: The truth value of the compound

statement P \wedge QP∧Q is only true if the truth
values PP and QQ are both true. Otherwise, P \wedge
QP∧Q is false.

III. Truth Table

of Logical
Disjunction
Remember: The
truth value of the compound statement P \vee QP∨Q is
true if the truth value of either the two simple
statements PP and QQ is true. Moreso, P \vee QP∨Q is
also true when the truth values of both
statements PP and QQ are true. However, the only time
the disjunction statement P \vee QP∨Q is false, happens
when the truth values of both PP and QQ are false.
IV. Truth Table of Logical Implication
Remember: The truth value of the compound statement P \
to QP→Q is true when both the simple
statements PP and QQ are true. Moreso, P \to QP→Q is
always true if PP is false. The only scenario that P \to
QP→Q is false happens when PP is true, and QQ is false.
V. Truth Table of Logical Biconditional or
Double Implication
Remember: The truth value of the biconditional statement P
\leftrightarrow QP↔Q is true when both simple
statements PP and QQ are both true or both false.
Otherwise, P \leftrightarrow QP↔Q is false.

3. What are the different sign in truth table?

Answer: