Scribd
Upload
7 views3 pages

Problem Set 4

The document presents five propositional logic statements and their formalizations, including conditional, biconditional, and conjunctions. It also includes five truth tables for various compound propositions, explaining the logical operations involved. Each section provides clear examples and explanations of how to derive the logical expressions and their truth values.

Uploaded by

Nia Lraew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views3 pages

Problem Set 4

The document presents five propositional logic statements and their formalizations, including conditional, biconditional, and conjunctions. It also includes five truth tables for various compound propositions, explaining the logical operations involved. Each section provides clear examples and explanations of how to derive the logical expressions and their truth values.

Uploaded by

Nia Lraew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

5-items Propositional Logic Statement


2. 5-items Propositional Logic Truth Table

5-items Propositional Logic Statement


1.) Let p = “It is raining” and q = “I will bring an umbrella”
Formalize the sentence: “If it is raining, then I will bring an umbrella.”
Answer: p → q
Explanation: Because the phrase uses “if then” statement, we represent it as a conditional p
implies q.

2.) Let p = “The dog is barking” and q = “Someone is at the door”


Formalize the sentence: “The dog is not barking if and only if someone is at the door.”
Answer: ¬ p ↔ q
Explanation: The phrase “if and only if” means a biconditional, so we use ↔ together with the
use of negation in the first propositional statement.

3.) Let p = “I pass the test” and q = “I studied hard”


Formalize the sentence: “It is necessary to study hard in order to pass the test.”
Answer: p → q
Explanation: “Necessary to study” means passing the test depends on the person studying, so
even though it looks reversed, it makes sense with the existing formation of words in the
sentence.

4.) Given that:


 p: The machine is working
 q: The lights are on
 r: The power is available
Formalize the sentence: “If the machine is working, then the lights are on and power is
available”
Answer: p → ( q ∧r )
Explanation: Because it says “then both lights are on and power is available”, we use the and
connective inside the parenthesis.
5.) Given that:
 p: I will exercise today
 q: I will eat healthy food
 r: I will feel great
Formalize the sentence: “If I exercise or eat healthy food, then I will feel great.”
Answer: ( p ∨q ) → r
Explanation: The word “or” joins exercising and eating healthy, and the whole leads to feeling
great, so the use of the connective or inside the parenthesis and then implication is important.

5- items Propositional Logic Truth Table


1.) Construct the truth table of the compound proposition: ( p ∧¬ q)
p q ¬q p ∧¬ q
T T F F
T F T T
F T F F
F F T F
Explanation: First, find the negation of q which is ¬ q in symbol, then use AND (∧) between
p and ¬ q. The result is true only when both p is true and q is false, notice how bit-by-bit it is
solved from knowing the values of the variables to the final answer.

2.) Construct the truth table of the compound proposition: ( p ∨q)→ q


p q p ∨q ( p ∨q) → q
T T T T
T F T F
F T T T
F F F T
Explanation: Compute p ∨q (OR). Then make a conditional where if p ∨q is true, q must
also be true. The implication is false only when the first part is true and the second part is
false.

3.) Construct the truth table of the compound proposition: ( p → q)∧(q → p)


p q p→q q→ p ( p → q)∧( p → q)
T T T T T
T F F T F
F T T F F
F F T T T

Explanation: Find both conditionals separately p → q and q → p, then use AND to combine
them. It is true only when both implications are true.

4.) Construct the truth table of the compound proposition: ¬( p ∨¬ q)


p q ¬q p ∨¬ q ¬( p ∨¬ q)
T T F T F
T F T T F
F T F F T
F F T T F
Explanation: Negate q first. Then OR (∨¿ the values of p and ¬ q. Finally, negate the result
of that. The final output is true only when both p is false and q is true.

5.) Construct the truth table of the compound proposition: ( p ∧r )→ (q ∨r )


p q r p ∧r q∨r ( p ∧r )→ (q ∨r )

T T T T T T
T T F F T T
T F T T T T
T F F F F T
F T T F T T
F T F F T T
F F T F T T
F F F F F T
Explanation: First find p ∧r and q ∨ r separately. Then use a conditional between them to be
solved, we know that implication(s) are only false when the first logic statement is true while
the second is false, in this case like what can be seen in the table, this implication doesn’t
happen, leaving the final answer to be all true.

You might also like