ReasoningAbility.com

Logical Connectives - Beginner Level: propositional connectives BEGINNER

Boost your speed and accuracy with this beginner friendly 📈 worksheet. Worksheet 5 of 30 presents 20 beginner-level logical connectives problems. Focus on propositional connectives while practicing propositional connectives, truth tables, logical equivalence. Difficulty: foundational concepts and basic patterns. Perfect for entry-level test takers.

📝 Worksheet 5 of 30 • 20 questions • ⏱️ Estimated time: 20 minutes • 🎯 Beginner level

What you'll learn in this worksheet:
Your progress through Logical Connectives
Worksheet 5 of 30 (16% complete)

Question 1

Consider the statement: p: The door is locked If p is False, what is the truth value of ¬p (NOT p)?
Step 1: Understand the negation (NOT) operator
The negation ¬p simply reverses the truth value of p.
If p is True, then ¬p is False.
If p is False, then ¬p is True.

Step 2: Apply the given value
p = False

Step 3: Evaluate ¬p
Since p is False, ¬p = True
In other words: ¬p: The door is not locked is True
negation, basic

Question 2

Given: p → q, p What can you validly derive?
Rule: Modus Ponens (→-elimination)

If P → Q and P are true, Q must be true.

Answer: q
deduction, proof, inference-rules

Question 3

Evaluate the compound logical expression: ¬(p ∧ q) Given: p = False, q = False
Step 1: Break down the compound expression
Expression: ¬(p ∧ q)

Step 2: Evaluate inner expression first
p ∧ q = False ∧ False = False

Step 3: Apply negation
¬(False) = True
Negation reverses the truth value
compound, nested, complex

Question 4

Consider the statements: p: The meeting is on Monday q: The meeting is on Tuesday If p is True and q is False, what is the truth value of p ∨ q (p OR q)?
Step 1: Understand the disjunction (OR) operator
The disjunction p ∨ q is True when AT LEAST ONE of p or q is True.
It is False ONLY when both p and q are False.

Step 2: Apply the given values
p = True, q = False

Step 3: Evaluate p ∨ q
Since at least one of p or q is True, p ∨ q = True
disjunction, truth-table, basic

Question 5

Consider the statements: p: Sarah is present q: Sarah is attentive If p is False and q is False, what is the truth value of p ∧ q (p AND q)?
Step 1: Understand the conjunction (AND) operator
The conjunction p ∧ q is True ONLY when BOTH p and q are True.

Step 2: Apply the given values
p = False, q = False

Step 3: Evaluate p ∧ q
Since at least one of p or q is False, p ∧ q = False
conjunction, truth-table, basic

Question 6

Consider the statements: p: John studies hard q: John passes the exam If p is True and q is True, what is the truth value of p ∧ q (p AND q)?
Step 1: Understand the conjunction (AND) operator
The conjunction p ∧ q is True ONLY when BOTH p and q are True.

Step 2: Apply the given values
p = True, q = True

Step 3: Evaluate p ∧ q
Since both p and q are True, p ∧ q = True
conjunction, truth-table, basic

Question 7

Person A says: 'I am a knave.' Is this statement possible?
Step 1: Test if A is a knight
If A is a knight, A tells the truth.
But A says 'I am a knave', which would be a lie.
Contradiction! A cannot be a knight.

Step 2: Test if A is a knave
If A is a knave, A lies.
But A says 'I am a knave', which would be true.
Contradiction! A cannot be a knave.

Step 3: Conclusion
Neither possibility works.
This statement is a LOGICAL PARADOX.
No one can truthfully or falsely claim to be a knave.

Answer: This statement is impossible
puzzle, logic-puzzle, advanced, competition

Question 8

Evaluate the compound logical expression: p → (q ∧ r) Given: p = True, q = False, r = True
Step 1: Break down the compound expression
Expression: p → (q ∧ r)

Step 2: Evaluate inner expression first
q ∧ r = False ∧ True = False

Step 3: Evaluate outer expression
p → (False) = True → False = False
Implication is False only when antecedent is True and consequent is False
compound, nested, complex

Question 9

Consider the statement: p: The sun is shining If p is False, what is the truth value of ¬p (NOT p)?
Step 1: Understand the negation (NOT) operator
The negation ¬p simply reverses the truth value of p.
If p is True, then ¬p is False.
If p is False, then ¬p is True.

Step 2: Apply the given value
p = False

Step 3: Evaluate ¬p
Since p is False, ¬p = True
In other words: ¬p: The sun is not shining is True
negation, basic

Question 10

Are the following two logical expressions equivalent? Expression 1: ¬(¬p) Expression 2: p Answer Yes or No and explain why.
Step 1: Understand what logical equivalence means
Two expressions are logically equivalent if they have the same truth value for ALL possible combinations of variables.

Step 2: Analyze the expressions
Expression 1: ¬(¬p)
Expression 2: p

Step 3: Apply Double Negation law
Two negations cancel each other out.
¬(¬p) simply gives back p.
These expressions ARE equivalent.
equivalence, laws, advanced

Question 11

Given: p ∧ q What can you validly derive?
Rule: Simplification (∧-elimination)

From a conjunction P ∧ Q, you can derive P (or Q) alone.

Answer: p
deduction, proof, inference-rules

Question 12

Evaluate the compound logical expression: (p ∨ q) → r Given: p = False, q = True, r = False
Step 1: Break down the compound expression
Expression: (p ∨ q) → r

Step 2: Evaluate inner expression first
p ∨ q = False ∨ True = True

Step 3: Evaluate outer expression
(True) → False = False
Implication is False only when antecedent is True and consequent is False
compound, nested, complex

Question 13

Consider the statement: "Either p: The light is on OR q: The light is off, but NOT both" If p is False and q is False, is this statement true?
Step 1: Understand Exclusive OR (XOR)
Exclusive OR (p ⊕ q) is True when EXACTLY ONE of p or q is True.
It is False when both are True or both are False.

Truth table for p ⊕ q:
p=T, q=T → Result=F (both true)
p=T, q=F → Result=T (exactly one)
p=F, q=T → Result=T (exactly one)
p=F, q=F → Result=F (neither true)

Step 2: Apply the given values
p = False, q = False

Step 3: Evaluate the exclusive OR
Since both have the same truth value, the exclusive OR is False
xor, exclusive-or, truth-table

Question 14

Consider the statement: 'The solution is neither hot nor cold' If p is T and q is F, what is the truth value of 'The solution is neither hot nor cold'?
Step 1: Understand 'neither...nor' statements
'Neither p nor q' means 'not p AND not q'
Logical form: ¬p ∧ ¬q

Step 2: Build the truth table
¬p ∧ ¬q is True ONLY when both p and q are False
Truth table:
p=T, q=T → ¬T ∧ ¬T = F ∧ F = F
p=T, q=F → ¬T ∧ ¬F = F ∧ T = F
p=F, q=T → ¬F ∧ ¬T = T ∧ F = F
p=F, q=F → ¬F ∧ ¬F = T ∧ T = T

Step 3: Apply given values
p = T, q = F
¬p = F, ¬q = T
¬p ∧ ¬q = F

Answer: False
neither-nor, joint-negation, advanced

Question 15

Consider the biconditional statement: "p: A number is divisible by 4 if and only if q: The number is even" (p ↔ q) If p is False and q is True, what is the truth value of p ↔ q?
Step 1: Understand the biconditional (↔) operator
The biconditional p ↔ q is True when BOTH p and q have the SAME truth value.
It is False when p and q have DIFFERENT truth values.

Truth table for p ↔ q:
p=T, q=T → Result=T (same)
p=T, q=F → Result=F (different)
p=F, q=T → Result=F (different)
p=F, q=F → Result=T (same)

Step 2: Apply the given values
p = False, q = True

Step 3: Evaluate p ↔ q
Since p and q have different truth values, p ↔ q = False
biconditional, truth-table, equivalence

Question 16

Consider the statements: p: Lisa likes coffee q: Lisa likes tea If p is True and q is False, what is the truth value of p ∨ q (p OR q)?
Step 1: Understand the disjunction (OR) operator
The disjunction p ∨ q is True when AT LEAST ONE of p or q is True.
It is False ONLY when both p and q are False.

Step 2: Apply the given values
p = True, q = False

Step 3: Evaluate p ∨ q
Since at least one of p or q is True, p ∨ q = True
disjunction, truth-table, basic

Question 17

Classify the following logical statement: p ∧ ¬p Is it a Tautology (always True), Contradiction (always False), or Contingent (depends on variables)?
Step 1: Understand the classifications
• Tautology: Always True for all possible truth values
• Contradiction: Always False for all possible truth values
• Contingent: True for some values, False for others

Step 2: Analyze the expression
Expression: p ∧ ¬p

Step 3: Test all possible combinations
Truth table:
p=T: T ∧ F = F
p=F: F ∧ T = F
Result: Always False → CONTRADICTION
This violates the Law of Non-Contradiction
tautology, contradiction, classification

Question 18

Consider the statement: 'Neither John nor Mary came' If p is T and q is T, what is the truth value of 'Neither John nor Mary came'?
Step 1: Understand 'neither...nor' statements
'Neither p nor q' means 'not p AND not q'
Logical form: ¬p ∧ ¬q

Step 2: Build the truth table
¬p ∧ ¬q is True ONLY when both p and q are False
Truth table:
p=T, q=T → ¬T ∧ ¬T = F ∧ F = F
p=T, q=F → ¬T ∧ ¬F = F ∧ T = F
p=F, q=T → ¬F ∧ ¬T = T ∧ F = F
p=F, q=F → ¬F ∧ ¬F = T ∧ T = T

Step 3: Apply given values
p = T, q = T
¬p = F, ¬q = F
¬p ∧ ¬q = F

Answer: False
neither-nor, joint-negation, advanced

Question 19

Given the conditional statement: "If a number is divisible by 4, then it is even" (p → q) What is the Inverse of this statement?
Step 1: Understand the original statement
Original: p → q means "If a number is divisible by 4, then it is even"

Step 2: Understand Inverse
Inverse negates both parts: ¬p → ¬q
If the original is p → q, the inverse is ¬p → ¬q

Step 3: Apply to our statement
Inverse: If a number is divisible by 4 is false, then it is even is false
transformations, conditional, advanced

Question 20

Consider the biconditional statement: "p: The shape is a square if and only if q: The shape has 4 equal sides and 4 right angles" (p ↔ q) If p is False and q is False, what is the truth value of p ↔ q?
Step 1: Understand the biconditional (↔) operator
The biconditional p ↔ q is True when BOTH p and q have the SAME truth value.
It is False when p and q have DIFFERENT truth values.

Truth table for p ↔ q:
p=T, q=T → Result=T (same)
p=T, q=F → Result=F (different)
p=F, q=T → Result=F (different)
p=F, q=F → Result=T (same)

Step 2: Apply the given values
p = False, q = False

Step 3: Evaluate p ↔ q
Since p and q have the same truth value (False), p ↔ q = True
biconditional, truth-table, equivalence
Previous Worksheet Next Worksheet