Truth Table Flashcards: Connectives & Logical Equivalence

Cartes de ce paquet

1. Carte 1

   Question

   In classical propositional logic, what is a proposition?

   Réponse

   A statement with a truth value: true or false. A question or command is not a proposition in this setting.

2. Carte 2

   Question

   What does negation (¬p) do to the truth value of p?

   Réponse

   It reverses it: true becomes false, and false becomes true.

3. Carte 3

   Question

   When is the conjunction (p ∧ q) true?

   Réponse

   Only when p and q are both true.

4. Carte 4

   Question

   When is the inclusive disjunction (p ∨ q) true?

   Réponse

   When at least one of p and q is true, including when both are true.

5. Carte 5

   Question

   What does one valuation assign in a propositional truth table?

   Réponse

   One truth value to each proposition letter. The assignment stays fixed throughout that row.

6. Carte 6

   Question

   When is the material conditional (p → q) false?

   Réponse

   Only when p is true and q is false. Here p is the antecedent and q is the consequent.

7. Carte 7

   Question

   When is the biconditional (p ↔ q) true?

   Réponse

   When p and q have the same truth value: both true or both false.

8. Carte 8

   Question

   When is exclusive OR (p ⊕ q) true?

   Réponse

   When exactly one of p and q is true. It is false when their truth values match.

9. Carte 9

   Question

   What is the main connective in ((¬p) ∧ q)?

   Réponse

   ∧ (AND). It combines the whole left part, (¬p), with q.

10. Carte 10

    Question

    How many rows does a complete truth table with three distinct proposition letters need?

    Réponse

    8 rows: each of the three letters has two choices, so 2³ = 8.

11. Carte 11

    Question

    If p = F, what is (¬p)?

    Réponse

    T. Negation reverses F to T.

12. Carte 12

    Question

    If p = T and q = F, what is (p ∧ q)?

    Réponse

    F. AND needs both inputs to be true.

13. Carte 13

    Question

    If p = T and q = T, what is inclusive OR (p ∨ q)?

    Réponse

    T. Inclusive OR allows both inputs to be true.

14. Carte 14

    Question

    If p = T and q = T, what is the material conditional (p → q)?

    Réponse

    T. A true antecedent with a true consequent does not make the conditional false.

15. Carte 15

    Question

    If p = F and q = F, what is (p ↔ q)?

    Réponse

    T. The two truth values match, even though neither is true.

16. Carte 16

    Question

    If p = T and q = T, what is exclusive OR (p ⊕ q)?

    Réponse

    F. XOR requires exactly one true input.

17. Carte 17

    Question

    Does a true material conditional (p → q) establish that p causes q?

    Réponse

    No. Material implication is determined by truth values; it does not establish causation or capture every everyday use of “if”.

18. Carte 18

    Question

    What assignments are listed by the two-letter row order TT, TF, FT, FF?

    Réponse

    (p, q) = (T, T), (T, F), (F, T), (F, F). Each possible assignment appears once.

19. Carte 19

    Question

    In ¬(p ∨ q), does ¬ negate just p or the whole disjunction?

    Réponse

    The whole disjunction (p ∨ q). Evaluate that parenthesized expression before negating it.

20. Carte 20

    Question

    If p = F and q = T, what is the material conditional (p → q)?

    Réponse

    T. A material conditional with a false antecedent is true.

21. Carte 21

    Question

    If p = T and q = F, what is (p ↔ q)?

    Réponse

    F. The two truth values differ.

22. Carte 22

    Question

    If p = T and q = F, what is exclusive OR (p ⊕ q)?

    Réponse

    T. Exactly one input is true.

23. Carte 23

    Question

    Which standard connective is true exactly when both inputs are true?

    Réponse

    Conjunction (AND), written ∧.

24. Carte 24

    Question

    Which standard connective is false exactly when both inputs are false?

    Réponse

    Inclusive disjunction (OR), written ∨. The both-true case is true.

25. Carte 25

    Question

    Which standard connective takes one input and reverses its truth value?

    Réponse

    Negation (NOT), written ¬.

26. Carte 26

    Question

    If p = F and q = F, what is the material conditional (p → q)?

    Réponse

    T. Its only false case requires a true antecedent and a false consequent.

27. Carte 27

    Question

    Which standard connective is true exactly when its two inputs have matching truth values?

    Réponse

    The biconditional (if and only if), written ↔.

28. Carte 28

    Question

    Which standard connective is true exactly when its two inputs have different truth values?

    Réponse

    Exclusive OR (XOR), written ⊕.

29. Carte 29

    Question

    What is the main connective in ((p ∨ q) → (¬r))?

    Réponse

    → (the material conditional). The entire disjunction is the antecedent, and (¬r) is the consequent.

30. Carte 30

    Question

    Which standard connective is false exactly when its first input is true and its second input is false?

    Réponse

    The material conditional, written →. Input order matters.

31. Carte 31

    Question

    Give the output column for (p ∧ q), with (p, q) rows TT, TF, FT, FF.

    Réponse

    T, F, F, F. Only the both-true row satisfies AND.

32. Carte 32

    Question

    If p = T and q = F, what is ¬(p ∧ q)?

    Réponse

    T. First (p ∧ q) is F; negating it gives T.

33. Carte 33

    Question

    Let a mean “the archive is open” and b mean “the desk is staffed”. Symbolize “the archive is open and the desk is staffed”.

    Réponse

    (a ∧ b). Both statements are asserted.

34. Carte 34

    Question

    Give the output column for the material conditional (p → q), with (p, q) rows TT, TF, FT, FF.

    Réponse

    T, F, T, T. Only the true-antecedent, false-consequent row fails.

35. Carte 35

    Question

    What makes a formula a tautology in classical propositional logic?

    Réponse

    It is true on every possible valuation, not just the row currently being checked.

36. Carte 36

    Question

    Give the output column for inclusive OR (p ∨ q), with (p, q) rows TT, TF, FT, FF.

    Réponse

    T, T, T, F. Only the both-false row fails inclusive OR.

37. Carte 37

    Question

    When are two propositional formulas logically equivalent?

    Réponse

    When their final truth values match on every valuation of their combined proposition letters.

38. Carte 38

    Question

    Give the output column for (p ↔ q), with (p, q) rows TT, TF, FT, FF.

    Réponse

    T, F, F, T. The first and last rows have matching truth values.

39. Carte 39

    Question

    If p = F and q = T, what is (p ∨ (¬q)), using inclusive OR?

    Réponse

    F. Both p and (¬q) are F.

40. Carte 40

    Question

    If p = T and q = F, what is the material conditional (p → q)?

    Réponse

    F. This is its only false input combination.

41. Carte 41

    Question

    Give the output column for (¬p), with p rows T, F.

    Réponse

    F, T. Negation reverses each row.

42. Carte 42

    Question

    Let s mean “the scan succeeds” and a mean “the alert appears”. Symbolize “if the scan succeeds, the alert appears”, using material implication.

    Réponse

    (s → a). The scan statement is the antecedent; the alert statement is the consequent.

43. Carte 43

    Question

    Give the output column for exclusive OR (p ⊕ q), with (p, q) rows TT, TF, FT, FF.

    Réponse

    F, T, T, F. Exactly one input is true in the middle two rows.

44. Carte 44

    Question

    What makes a formula a contradiction in classical propositional logic?

    Réponse

    It is false on every possible valuation.

45. Carte 45

    Question

    If p = T, q = F and r = T, what is ((p ∧ q) ∨ r), using inclusive OR?

    Réponse

    T. The conjunction is F, but r is T, so the disjunction is T.

46. Carte 46

    Question

    Simplify ¬(¬p) without changing its truth value.

    Réponse

    p. Two negations restore the original truth value.

47. Carte 47

    Question

    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”.

    Réponse

    (d ↔ c). Both directions of the conditional are required.

48. Carte 48

    Question

    What makes a propositional formula contingent?

    Réponse

    It is true on at least one valuation and false on at least one other valuation.

49. Carte 49

    Question

    If p = T and q = T, what is (p → (¬q)), using material implication?

    Réponse

    F. Its antecedent is T and its consequent (¬q) is F.

50. Carte 50

    Question

    Use De Morgan’s law to rewrite ¬(p ∧ q) with negations only on letters.

    Réponse

    ((¬p) ∨ (¬q)). At least one conjunct must be false; ∨ is inclusive OR.

51. Carte 51

    Question

    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”.

    Réponse

    (n ∨ e). This is inclusive OR.

52. Carte 52

    Question

    Classify (p ∨ (¬p)): tautology, contradiction or contingent? Use classical logic and inclusive OR.

    Réponse

    Tautology. Whether p is T or F, one disjunct is T.

53. Carte 53

    Question

    If p = F and q = F, what is ¬(p ∨ q), using inclusive OR?

    Réponse

    T. The disjunction is F, so its negation is T.

54. Carte 54

    Question

    Use De Morgan’s law to rewrite ¬(p ∨ q) with negations only on letters. Use inclusive OR.

    Réponse

    ((¬p) ∧ (¬q)). Both disjuncts must be false.

55. Carte 55

    Question

    Let w mean “the window is closed” and h mean “the heater is on”. Read (h → w) as an English material conditional.

    Réponse

    If the heater is on, then the window is closed. The formula itself makes no causal claim.

56. Carte 56

    Question

    Classify (p ∧ (¬p)): tautology, contradiction or contingent?

    Réponse

    Contradiction. The two conjuncts cannot both be true on any valuation.

57. Carte 57

    Question

    Rewrite the material conditional (p → q) using only NOT and inclusive OR.

    Réponse

    ((¬p) ∨ q). It is false exactly when p is T and q is F.

58. Carte 58

    Question

    If p = T, q = T and r = F, what is ((p ⊕ q) ↔ r), where ⊕ is exclusive OR?

    Réponse

    T. The XOR is F and r is F, so the biconditional compares matching values.

59. Carte 59

    Question

    Write an expression with exactly two NOT operators that is equivalent to p.

    Réponse

    ¬(¬p). Negating twice leaves every truth value unchanged.

60. Carte 60

    Question

    Classify (p ∧ q): tautology, contradiction or contingent?

    Réponse

    Contingent. It is T at p = T, q = T and F at p = F, q = T.

61. Carte 61

    Question

    What is the contrapositive of the material conditional (p → q)?

    Réponse

    ((¬q) → (¬p)). Swap the two sides and negate both.

62. Carte 62

    Question

    Rewrite ¬(p → q) using AND and NOT, with → meaning material implication.

    Réponse

    (p ∧ (¬q)). A material conditional fails exactly when its antecedent is true and its consequent is false.

63. Carte 63

    Question

    Rewrite ((¬p) ∨ (¬q)) as one negation of a conjunction, using inclusive OR.

    Réponse

    ¬(p ∧ q). This is De Morgan’s law in the reverse direction.

64. Carte 64

    Question

    Give the output column for (p ∨ (¬q)), with (p, q) rows TT, TF, FT, FF and inclusive OR.

    Réponse

    T, T, F, T. The only false row has p = F and q = T.

65. Carte 65

    Question

    What is the converse of (p → q)?

    Réponse

    (q → p). Swap the antecedent and consequent without negating either.

66. Carte 66

    Question

    Rewrite (p ↔ q) as an AND of two material conditionals.

    Réponse

    ((p → q) ∧ (q → p)). Both directions must hold.

67. Carte 67

    Question

    Rewrite ((¬p) ∧ (¬q)) as one negation of an inclusive disjunction.

    Réponse

    ¬(p ∨ q). This is De Morgan’s law in the reverse direction.

68. Carte 68

    Question

    Give one valuation showing that (p ∨ q) and (p ∧ q) are not equivalent. Use inclusive OR.

    Réponse

    p = T, q = F gives T for the OR and F for the AND. The swapped assignment also works.

69. Carte 69

    Question

    What is the inverse of (p → q)?

    Réponse

    ((¬p) → (¬q)). Negate both sides without swapping them.

70. Carte 70

    Question

    Rewrite ((¬p) ∨ q) as a single material conditional, using inclusive OR.

    Réponse

    (p → q). Both expressions fail exactly when p is T and q is F.

71. Carte 71

    Question

    Rewrite exclusive OR (p ⊕ q) using AND, inclusive OR and NOT.

    Réponse

    ((p ∨ q) ∧ ¬(p ∧ q)). Require at least one true input and rule out both being true.

72. Carte 72

    Question

    A formula is true for p = T and q = F. Is that enough to call it a tautology?

    Réponse

    No. A tautology must be true on every valuation. One true row establishes only that it can be true.

73. Carte 73

    Question

    Is a material conditional (p → q) logically equivalent to its contrapositive ((¬q) → (¬p))?

    Réponse

    Yes. Both are false exactly when p is T and q is F.

74. Carte 74

    Question

    Give one valuation showing that (p → q) and its converse (q → p) are not equivalent. Use material implication.

    Réponse

    p = T, q = F. Then (p → q) is F and (q → p) is T.

75. Carte 75

    Question

    Rewrite ((p → q) ∧ (q → p)) using one connective, with both arrows meaning material implication.

    Réponse

    (p ↔ q). This is the biconditional.

76. Carte 76

    Question

    What does one valuation with different outputs prove about two formulas?

    Réponse

    They are not logically equivalent. Equivalence requires agreement on every valuation.

77. Carte 77

    Question

    Give one valuation showing that (p → q) and its inverse ((¬p) → (¬q)) are not equivalent. Use material implication.

    Réponse

    p = T, q = F. The original is F, while the inverse has a false antecedent and is T.

78. Carte 78

    Question

    Give one valuation showing that ¬(p ∧ q) and ((¬p) ∧ (¬q)) are not equivalent.

    Réponse

    p = T, q = F. The negated conjunction is T; the conjunction of negations is F.

79. Carte 79

    Question

    Which connective does ((p ∨ q) ∧ ¬(p ∧ q)) express? Here ∨ is inclusive OR.

    Réponse

    Exclusive OR: (p ⊕ q). Exactly one input must be true.

80. Carte 80

    Question

    If (p ↔ q) is true on one row, does that show that the formulas p and q are logically equivalent?

    Réponse

    No. They match on that row only. Logical equivalence requires the biconditional to be true on every valuation.

81. Carte 81

    Question

    Are the converse (q → p) and inverse ((¬p) → (¬q)) of (p → q) equivalent to each other? Use material implication.

    Réponse

    Yes. They are contrapositives of each other, and both are false exactly when q is T and p is F.

82. Carte 82

    Question

    At p = T, q = F and r = F, compare ((p ∨ q) ∧ r) with (p ∨ (q ∧ r)). Use inclusive OR.

    Réponse

    The first is F; the second is T. Parentheses change which operations combine first.

83. Carte 83

    Question

    Rewrite (p ∧ (¬q)) as the negation of one material conditional.

    Réponse

    ¬(p → q). The conjunction describes exactly the conditional’s false case.

84. Carte 84

    Question

    Among AND (∧), inclusive OR (∨), XOR (⊕), material conditional (→) and biconditional (↔), which has outputs T, F, F, T for (p, q) rows TT, TF, FT, FF?

    Réponse

    Biconditional (↔). It is true on the two rows where the inputs match.

84 cartes

Truth Table Flashcards: Connectives & Logical Equivalence

Réviser ce paquet gratuitement

Nibomo s'ouvre pour que vous puissiez commencer à réviser.