Truth Table Flashcards: Connectives & Logical Equivalence
84 truth-table flashcards on logical connectives, material conditionals, nested expressions, equivalence, and counterexamples, with short explanations.
A pakliról
Practice propositional logic with 84 English truth-table flashcards. The set covers NOT (¬), AND (∧), inclusive OR (∨), exclusive OR (⊕), the material conditional (→), and the biconditional (↔). T means true and F means false. It suits learners starting formal logic or discrete mathematics.
Cards ask you to recall a connective’s truth conditions, identify a connective from its full rule, evaluate an expression from a stated assignment, and produce short output columns with an explicit row order. A few original statement-to-symbol tasks and one symbol-to-statement task connect the notation to English. Later cards practice De Morgan’s laws, double negation, conditional rewriting, biconditional and XOR expansions, negated conditionals, and the distinction between a conditional, its converse, inverse, and contrapositive.
The sequence introduces notation and simple connectives before nested expressions, logical equivalence, counterexamples, and tautology/contradiction/contingency classification. Selected equivalences have separate forward and reverse cards, placed apart. Answers start with the result and give a short reason. For a counterexample task, any assignment that makes the two outputs differ is a valid answer.
This is a focused practice set, not a full logic course or an exam syllabus. It excludes quantified statements, proof systems, circuits, and programming-language evaluation rules. It does not ask for a connective from a lone truth value, which would be ambiguous, or repeat every possible symbolic and English permutation. Material implication is used as a truth-functional rule; the cards do not treat it as a theory of causation or every everyday use of “if”.
For a short introduction, read truth values, conjunction and disjunction. For study habits, see how to use flashcards for math.
The questions, answers, examples, order, metadata, and cover were independently created with AI assistance. Logic facts were checked against the open textbook forall x: Calgary, especially its chapters on connective truth tables, complete truth tables, and semantic concepts, and by direct truth-value calculation. No textbook exercises, teaching prose, diagrams, examination questions, or competitor cards were copied. The original text and generated cover are released under CC0 1.0 to the extent applicable rights exist; reference-source text retains its own license. This is an independent resource, unaffiliated with the Open Logic Project or any school or examination provider.
Kártyák ebben a pakliban
1. kártya
Kérdés
In classical propositional logic, what is a proposition?
Válasz
A statement with a truth value: true or false. A question or command is not a proposition in this setting.
2. kártya
Kérdés
What does negation (¬p) do to the truth value of p?
Válasz
It reverses it: true becomes false, and false becomes true.
3. kártya
Kérdés
When is the conjunction (p ∧ q) true?
Válasz
Only when p and q are both true.
4. kártya
Kérdés
When is the inclusive disjunction (p ∨ q) true?
Válasz
When at least one of p and q is true, including when both are true.
5. kártya
Kérdés
What does one valuation assign in a propositional truth table?
Válasz
One truth value to each proposition letter. The assignment stays fixed throughout that row.
6. kártya
Kérdés
When is the material conditional (p → q) false?
Válasz
Only when p is true and q is false. Here p is the antecedent and q is the consequent.
7. kártya
Kérdés
When is the biconditional (p ↔ q) true?
Válasz
When p and q have the same truth value: both true or both false.
8. kártya
Kérdés
When is exclusive OR (p ⊕ q) true?
Válasz
When exactly one of p and q is true. It is false when their truth values match.
9. kártya
Kérdés
What is the main connective in ((¬p) ∧ q)?
Válasz
∧ (AND). It combines the whole left part, (¬p), with q.
10. kártya
Kérdés
How many rows does a complete truth table with three distinct proposition letters need?
Válasz
8 rows: each of the three letters has two choices, so 2³ = 8.
11. kártya
Kérdés
If p = F, what is (¬p)?
Válasz
T. Negation reverses F to T.
12. kártya
Kérdés
If p = T and q = F, what is (p ∧ q)?
Válasz
F. AND needs both inputs to be true.
13. kártya
Kérdés
If p = T and q = T, what is inclusive OR (p ∨ q)?
Válasz
T. Inclusive OR allows both inputs to be true.
14. kártya
Kérdés
If p = T and q = T, what is the material conditional (p → q)?
Válasz
T. A true antecedent with a true consequent does not make the conditional false.
15. kártya
Kérdés
If p = F and q = F, what is (p ↔ q)?
Válasz
T. The two truth values match, even though neither is true.
16. kártya
Kérdés
If p = T and q = T, what is exclusive OR (p ⊕ q)?
Válasz
F. XOR requires exactly one true input.
17. kártya
Kérdés
Does a true material conditional (p → q) establish that p causes q?
Válasz
No. Material implication is determined by truth values; it does not establish causation or capture every everyday use of “if”.
18. kártya
Kérdés
What assignments are listed by the two-letter row order TT, TF, FT, FF?
Válasz
(p, q) = (T, T), (T, F), (F, T), (F, F). Each possible assignment appears once.
19. kártya
Kérdés
In ¬(p ∨ q), does ¬ negate just p or the whole disjunction?
Válasz
The whole disjunction (p ∨ q). Evaluate that parenthesized expression before negating it.
20. kártya
Kérdés
If p = F and q = T, what is the material conditional (p → q)?
Válasz
T. A material conditional with a false antecedent is true.
21. kártya
Kérdés
If p = T and q = F, what is (p ↔ q)?
Válasz
F. The two truth values differ.
22. kártya
Kérdés
If p = T and q = F, what is exclusive OR (p ⊕ q)?
Válasz
T. Exactly one input is true.
23. kártya
Kérdés
Which standard connective is true exactly when both inputs are true?
Válasz
Conjunction (AND), written ∧.
24. kártya
Kérdés
Which standard connective is false exactly when both inputs are false?
Válasz
Inclusive disjunction (OR), written ∨. The both-true case is true.
25. kártya
Kérdés
Which standard connective takes one input and reverses its truth value?
Válasz
Negation (NOT), written ¬.
26. kártya
Kérdés
If p = F and q = F, what is the material conditional (p → q)?
Válasz
T. Its only false case requires a true antecedent and a false consequent.
27. kártya
Kérdés
Which standard connective is true exactly when its two inputs have matching truth values?
Válasz
The biconditional (if and only if), written ↔.
28. kártya
Kérdés
Which standard connective is true exactly when its two inputs have different truth values?
Válasz
Exclusive OR (XOR), written ⊕.
29. kártya
Kérdés
What is the main connective in ((p ∨ q) → (¬r))?
Válasz
→ (the material conditional). The entire disjunction is the antecedent, and (¬r) is the consequent.
30. kártya
Kérdés
Which standard connective is false exactly when its first input is true and its second input is false?
Válasz
The material conditional, written →. Input order matters.
31. kártya
Kérdés
Give the output column for (p ∧ q), with (p, q) rows TT, TF, FT, FF.
Válasz
T, F, F, F. Only the both-true row satisfies AND.
32. kártya
Kérdés
If p = T and q = F, what is ¬(p ∧ q)?
Válasz
T. First (p ∧ q) is F; negating it gives T.
33. kártya
Kérdés
Let a mean “the archive is open” and b mean “the desk is staffed”. Symbolize “the archive is open and the desk is staffed”.
Válasz
(a ∧ b). Both statements are asserted.
34. kártya
Kérdés
Give the output column for the material conditional (p → q), with (p, q) rows TT, TF, FT, FF.
Válasz
T, F, T, T. Only the true-antecedent, false-consequent row fails.
35. kártya
Kérdés
What makes a formula a tautology in classical propositional logic?
Válasz
It is true on every possible valuation, not just the row currently being checked.
36. kártya
Kérdés
Give the output column for inclusive OR (p ∨ q), with (p, q) rows TT, TF, FT, FF.
Válasz
T, T, T, F. Only the both-false row fails inclusive OR.
37. kártya
Kérdés
When are two propositional formulas logically equivalent?
Válasz
When their final truth values match on every valuation of their combined proposition letters.
38. kártya
Kérdés
Give the output column for (p ↔ q), with (p, q) rows TT, TF, FT, FF.
Válasz
T, F, F, T. The first and last rows have matching truth values.
39. kártya
Kérdés
If p = F and q = T, what is (p ∨ (¬q)), using inclusive OR?
Válasz
F. Both p and (¬q) are F.
40. kártya
Kérdés
If p = T and q = F, what is the material conditional (p → q)?
Válasz
F. This is its only false input combination.
41. kártya
Kérdés
Give the output column for (¬p), with p rows T, F.
Válasz
F, T. Negation reverses each row.
42. kártya
Kérdés
Let s mean “the scan succeeds” and a mean “the alert appears”. Symbolize “if the scan succeeds, the alert appears”, using material implication.
Válasz
(s → a). The scan statement is the antecedent; the alert statement is the consequent.
43. kártya
Kérdés
Give the output column for exclusive OR (p ⊕ q), with (p, q) rows TT, TF, FT, FF.
Válasz
F, T, T, F. Exactly one input is true in the middle two rows.
44. kártya
Kérdés
What makes a formula a contradiction in classical propositional logic?
Válasz
It is false on every possible valuation.
45. kártya
Kérdés
If p = T, q = F and r = T, what is ((p ∧ q) ∨ r), using inclusive OR?
Válasz
T. The conjunction is F, but r is T, so the disjunction is T.
46. kártya
Kérdés
Simplify ¬(¬p) without changing its truth value.
Válasz
p. Two negations restore the original truth value.
47. kártya
Kérdés
Let d mean “the door is unlocked” and c mean “the code is accepted”. Symbolize “the door is unlocked if and only if the code is accepted”.
Válasz
(d ↔ c). Both directions of the conditional are required.
48. kártya
Kérdés
What makes a propositional formula contingent?
Válasz
It is true on at least one valuation and false on at least one other valuation.
49. kártya
Kérdés
If p = T and q = T, what is (p → (¬q)), using material implication?
Válasz
F. Its antecedent is T and its consequent (¬q) is F.
50. kártya
Kérdés
Use De Morgan’s law to rewrite ¬(p ∧ q) with negations only on letters.
Válasz
((¬p) ∨ (¬q)). At least one conjunct must be false; ∨ is inclusive OR.
51. kártya
Kérdés
Let n mean “the north path is open” and e mean “the east path is open”. Symbolize “at least one of these paths is open, possibly both”.
Válasz
(n ∨ e). This is inclusive OR.
52. kártya
Kérdés
Classify (p ∨ (¬p)): tautology, contradiction or contingent? Use classical logic and inclusive OR.
Válasz
Tautology. Whether p is T or F, one disjunct is T.
53. kártya
Kérdés
If p = F and q = F, what is ¬(p ∨ q), using inclusive OR?
Válasz
T. The disjunction is F, so its negation is T.
54. kártya
Kérdés
Use De Morgan’s law to rewrite ¬(p ∨ q) with negations only on letters. Use inclusive OR.
Válasz
((¬p) ∧ (¬q)). Both disjuncts must be false.
55. kártya
Kérdés
Let w mean “the window is closed” and h mean “the heater is on”. Read (h → w) as an English material conditional.
Válasz
If the heater is on, then the window is closed. The formula itself makes no causal claim.
56. kártya
Kérdés
Classify (p ∧ (¬p)): tautology, contradiction or contingent?
Válasz
Contradiction. The two conjuncts cannot both be true on any valuation.
57. kártya
Kérdés
Rewrite the material conditional (p → q) using only NOT and inclusive OR.
Válasz
((¬p) ∨ q). It is false exactly when p is T and q is F.
58. kártya
Kérdés
If p = T, q = T and r = F, what is ((p ⊕ q) ↔ r), where ⊕ is exclusive OR?
Válasz
T. The XOR is F and r is F, so the biconditional compares matching values.
59. kártya
Kérdés
Write an expression with exactly two NOT operators that is equivalent to p.
Válasz
¬(¬p). Negating twice leaves every truth value unchanged.
60. kártya
Kérdés
Classify (p ∧ q): tautology, contradiction or contingent?
Válasz
Contingent. It is T at p = T, q = T and F at p = F, q = T.
61. kártya
Kérdés
What is the contrapositive of the material conditional (p → q)?
Válasz
((¬q) → (¬p)). Swap the two sides and negate both.
62. kártya
Kérdés
Rewrite ¬(p → q) using AND and NOT, with → meaning material implication.
Válasz
(p ∧ (¬q)). A material conditional fails exactly when its antecedent is true and its consequent is false.
63. kártya
Kérdés
Rewrite ((¬p) ∨ (¬q)) as one negation of a conjunction, using inclusive OR.
Válasz
¬(p ∧ q). This is De Morgan’s law in the reverse direction.
64. kártya
Kérdés
Give the output column for (p ∨ (¬q)), with (p, q) rows TT, TF, FT, FF and inclusive OR.
Válasz
T, T, F, T. The only false row has p = F and q = T.
65. kártya
Kérdés
What is the converse of (p → q)?
Válasz
(q → p). Swap the antecedent and consequent without negating either.
66. kártya
Kérdés
Rewrite (p ↔ q) as an AND of two material conditionals.
Válasz
((p → q) ∧ (q → p)). Both directions must hold.
67. kártya
Kérdés
Rewrite ((¬p) ∧ (¬q)) as one negation of an inclusive disjunction.
Válasz
¬(p ∨ q). This is De Morgan’s law in the reverse direction.
68. kártya
Kérdés
Give one valuation showing that (p ∨ q) and (p ∧ q) are not equivalent. Use inclusive OR.
Válasz
p = T, q = F gives T for the OR and F for the AND. The swapped assignment also works.
69. kártya
Kérdés
What is the inverse of (p → q)?
Válasz
((¬p) → (¬q)). Negate both sides without swapping them.
70. kártya
Kérdés
Rewrite ((¬p) ∨ q) as a single material conditional, using inclusive OR.
Válasz
(p → q). Both expressions fail exactly when p is T and q is F.
71. kártya
Kérdés
Rewrite exclusive OR (p ⊕ q) using AND, inclusive OR and NOT.
Válasz
((p ∨ q) ∧ ¬(p ∧ q)). Require at least one true input and rule out both being true.
72. kártya
Kérdés
A formula is true for p = T and q = F. Is that enough to call it a tautology?
Válasz
No. A tautology must be true on every valuation. One true row establishes only that it can be true.
73. kártya
Kérdés
Is a material conditional (p → q) logically equivalent to its contrapositive ((¬q) → (¬p))?
Válasz
Yes. Both are false exactly when p is T and q is F.
74. kártya
Kérdés
Give one valuation showing that (p → q) and its converse (q → p) are not equivalent. Use material implication.
Válasz
p = T, q = F. Then (p → q) is F and (q → p) is T.
75. kártya
Kérdés
Rewrite ((p → q) ∧ (q → p)) using one connective, with both arrows meaning material implication.
Válasz
(p ↔ q). This is the biconditional.
76. kártya
Kérdés
What does one valuation with different outputs prove about two formulas?
Válasz
They are not logically equivalent. Equivalence requires agreement on every valuation.
77. kártya
Kérdés
Give one valuation showing that (p → q) and its inverse ((¬p) → (¬q)) are not equivalent. Use material implication.
Válasz
p = T, q = F. The original is F, while the inverse has a false antecedent and is T.
78. kártya
Kérdés
Give one valuation showing that ¬(p ∧ q) and ((¬p) ∧ (¬q)) are not equivalent.
Válasz
p = T, q = F. The negated conjunction is T; the conjunction of negations is F.
79. kártya
Kérdés
Which connective does ((p ∨ q) ∧ ¬(p ∧ q)) express? Here ∨ is inclusive OR.
Válasz
Exclusive OR: (p ⊕ q). Exactly one input must be true.
80. kártya
Kérdés
If (p ↔ q) is true on one row, does that show that the formulas p and q are logically equivalent?
Válasz
No. They match on that row only. Logical equivalence requires the biconditional to be true on every valuation.
81. kártya
Kérdés
Are the converse (q → p) and inverse ((¬p) → (¬q)) of (p → q) equivalent to each other? Use material implication.
Válasz
Yes. They are contrapositives of each other, and both are false exactly when q is T and p is F.
82. kártya
Kérdés
At p = T, q = F and r = F, compare ((p ∨ q) ∧ r) with (p ∨ (q ∧ r)). Use inclusive OR.
Válasz
The first is F; the second is T. Parentheses change which operations combine first.
83. kártya
Kérdés
Rewrite (p ∧ (¬q)) as the negation of one material conditional.
Válasz
¬(p → q). The conjunction describes exactly the conditional’s false case.
84. kártya
Kérdés
Among AND (∧), inclusive OR (∨), XOR (⊕), material conditional (→) and biconditional (↔), which has outputs T, F, F, T for (p, q) rows TT, TF, FT, FF?
Válasz
Biconditional (↔). It is true on the two rows where the inputs match.
84 kártya
Truth Table Flashcards: Connectives & Logical Equivalence
A Nibomo megnyílik, és elkezdheted a tanulást.