Scribd
Upload
541 views2 pages

Discrete Structures Module 1 Answers

The document presents 5 activities that involve propositional logic: 1) Identifying statements as propositions or not. 2) Writing logical statements in words. 3) Constructing truth tables for compound propositions. 4) More truth tables to evaluate compound conditional and biconditional statements. 5) Evaluating the truth value of a complex statement using truth tables.

Uploaded by

GIN SAN
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
541 views2 pages

Discrete Structures Module 1 Answers

The document presents 5 activities that involve propositional logic: 1) Identifying statements as propositions or not. 2) Writing logical statements in words. 3) Constructing truth tables for compound propositions. 4) More truth tables to evaluate compound conditional and biconditional statements. 5) Evaluating the truth value of a complex statement using truth tables.

Uploaded by

GIN SAN
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 2

ACTIVITIES/ASSESSMENT:

A. Tell if the following statements are propositions or not.

1. Study hard! not a proposition

2. The Apple Macintosh is a 16-bit computer. proposition

3. 1 is an even number. proposition

4. Why are we here? not a proposition

5. 8 + 7 = 13. Proposition

B. p is “x < 50”, q is “x > 40”. Write the following in words.

1. ∼p = x is not less than fifty.

2. ∼q = x is not greater than forty.

3. p ∧ q = x is less than fifty and x is greater than forty.

4. p ∨ q = x is less than fifty or x is greater than forty.

5. ∼p ∧ q = x is not less than fifty and x is greater than forty.

6. ∼p ∧∼q = x is not less than fifty and x is not greater than 40.

C. Construct a truth table for the following:.

1. P ∧ (Q ∨ R) 2. (P ∧ Q) ∨ R

P Q R Q∨R P∧(Q∨R) P Q R (P∧Q (P∧Q)∨R


T T T T T )
T T F F F T T T T T
T F T F F T T F T T
T F F F F T F T F T
F T T T F T F F F F
F T F F F F T T F T
F F T F F F T F F F
F F F F F F F T F T
F F F F F
3. (P ∧ ∼Q) ∨ ∼P

P Q ~Q ~P (P∧~Q) (P∧~Q) ∨~P


T T F F T T
T T F F F F
T F T F T T
T F T F T T
F T F T F T
F T F T F T
F F T T F T
F F T T F T

4. P → (Q ∨ ∼R)

P Q R ~R (Q ∨ ∼R) P → (Q ∨ ∼R)
T T T F T T
T T F T T T
T F T F F F
T F F T T T
F T T F T T
F T F T T T
F F T F F T
F F F T T T

5. ∼ [(∼P → Q) ∨ (P → R)]

P Q R ~P (∼P → Q) (P → R) (∼P → Q)∨ (P → R) ∼ [(∼P → Q) ∨ (P → R)]


T T T F T T T F
T T F F T F T F
T F T F T T T F
T F F F T F T F
F T T T T T T F
F T F T T T T F
F F T T F T T F
F F F T F T T F

You might also like