LOGIC STATEMENT

AND QUANTIFIERS
C O M P O U N D S TAT E M E N T I N S Y M B O L I C F O R M
TRANSLATE SYMBOL STATEMENT
C O M P O U N D S TAT E M E N T A N D G R O U P I N G S Y M B O L
T R A N S L AT E C O M P O U N D S TAT E M E N T
T R U T H VA L U E O F A C O N J U N C T I O N A N D D I S J U N T I O N
 EXAMPLE:

SOLUTION:
EXAMPLE:
 L E S S O N 5 . 2 T R U T H TA B L E S , E Q U I VA L E N T S TAT E M E N T S
A N D TA U T O L O G I E S

In this section, we consider the methods of constructing truth tables for the
statement that involves a combination of conjunction, disjunction, and/or
negations. If the given statement involves only two statements, then start
with a table with four rows.
EXAMPLE:

SOLUTION:
 T R U T H TA B L E S
EXAMPLE:

SOLUTION:
A LT E R N AT E M E T H O D F O R C O N S T R U C T I N G T R U T H TA B L E S
EXAMPLE:

STEP BY STEP SOLUTION:

T H R E E - VA L U E D L O G I C
 E Q U I VA L E N T S TAT E M E N T

EXAMPLE:

SOLUTION:
D E M O R G A N ’ S L AW
EXAMPLE:

SOLUTION:
 TA U T O L O G Y A N D S E L F C O N T R A D I C T I O N

EXAMPLE:

SOLUTION:
 ASSIGNMENT 4.Let p, q and r represents the
following;
NOTE: To b e s u b m i t t e d o n F e b r u a r y 1 2 , 2 0 2 2

1. Determine whether each sentence is a statement

2. Write the negation of each statement. 5.Write the negation of the following
statements.

3. Use p, q, r and s and write the following

statement in symbolic form. 6.Do as stated.

7.Show that pV(pɅ~q) are equivalent

 REMINDERS:

Y O U W I L L B E H AV I N G Y O U R M I F T E R M N E X T
MEETING. THE TOPICS ARE AS FOLLOWS;

1. P R O B L E M S O LV I N G
2. S TAT I S T I C S
3. L O G I C