StudyFox
कीमतेंब्लॉगएक्सटेंशनमुफ़्त टूल
  • कीमतें
  • ब्लॉग
  • एक्सटेंशन
  • मुफ़्त टूल
  • शुरू करेंसाइन इन
StudyFox

अपने नोट्स, PDF और स्लाइड्स को फ़्लैशकार्ड, क्विज़, नोट्स और माइंड मैप में बदलें।

StudyFox खोलें

स्टडी टूल्स

  • होमवर्क हेल्पर
  • नोट मेकर
  • फ़्लैशकार्ड मेकर
  • क्विज़ मेकर
  • माइंड मैप मेकर

प्रोडक्ट

  • कीमतें
  • Chrome एक्सटेंशन
  • मुफ़्त एक्सटेंशन
  • स्टडी सेट देखें
  • ब्लॉग

सहायता

  • सहायता केंद्र
  • संपर्क करें
  • गोपनीयता नीति
  • सेवा की शर्तें

तुलना करें

  • Chegg का विकल्प
  • Course Hero का विकल्प
  • Coursology का विकल्प
  • Photomath का विकल्प
  • Gauthmath का विकल्प
  • PhotoSolve का विकल्प
  • CollegeTools का विकल्प
  • Transcript का विकल्प
  • SmartSolve का विकल्प
  • Homeworkify का विकल्प
  • AnswersAi का विकल्प
  • StudyX का विकल्प
  • Quizlet का विकल्प
  • Anki का विकल्प
  • Knowt का विकल्प
  • Brainscape का विकल्प
  • सभी तुलनाएँ

© 2026 StudyFox AI. सर्वाधिकार सुरक्षित।

  • X
  • Discord
  • Instagram
ExploreSocial StudiesPhilosophyLogic: Propositional Logic, Validity and Equivalences

Quiz · Medium

Logic: Propositional Logic, Validity and Equivalences

Questions on conditionals, truth tables, De Morgan, valid and invalid argument forms and basic predicate logic translations.

by Kill h.21 questionsCreated Nov 20, 2026, 08:28 PM
Philosophy· LogicTags#logic#propositional-logic#validity#truth-tables

21 questions

  1. 1

    A valid argument can have a false conclusion.

    • True

    • B

      False

    Yes, provided at least one premise is false. Validity says only that if all premises were true, the conclusion would have to be true.

  2. 2

    A sound argument must be...

    • A

      valid and have a conclusion that is merely plausible

    • B

      inductively strong with true premises

    • C

      invalid but with a true conclusion

    • valid and have only true premises

    Soundness = validity + true premises. Inductive strength with true premises is called cogency.

  3. 3

    Which argument form is valid?

    • A

      If P then Q; Q; therefore P

    • B

      If P then Q; not P; therefore not Q

    • If P then Q; not Q; therefore not P

    • D

      P or Q; P; therefore not Q

    This is modus tollens. Affirming the consequent and denying the antecedent are both invalid. 'P or Q; P; so not Q' wrongly treats inclusive or as exclusive.

  4. 4

    When is the conditional false?

    • When p is true and q is false

    • B

      When p is false and q is true

    • C

      When p and q are both false

    • D

      When p and q are both true

    A material conditional is false only when its antecedent is true and its consequent false. If p is false it is true regardless of q.

  5. 5

    What is the contrapositive of 'If it is a cat, then it is a mammal'?

    • A

      If it is a mammal, then it is a cat

    • B

      If it is not a cat, then it is not a mammal

    • C

      It is a cat and it is not a mammal

    • If it is not a mammal, then it is not a cat

    The contrapositive flips and negates both parts and is equivalent to the original. 'If it is a mammal, then it is a cat' is the converse and 'If it is not a cat, then it is not a mammal' is the inverse; neither is equivalent to the original.

  6. 6

    By De Morgan's laws, is equivalent to...

    • A

    • C

    • D

    Negating a conjunction gives a disjunction of negations. The tempting is the negation of a disjunction.

  7. 7

    How many rows are needed for a complete truth table with three distinct atomic statements?

    • A

      3

    • 8

    • C

      6

    • D

      9

    There are 2 to the power n rows: 2 x 2 x 2 = 8. It is not 3 x 3 or 3 x 2.

  8. 8

    Which of these is a tautology?

    • B

    • C

    • D

    Either p or not-p is always true (excluded middle). 'p and not-p' and 'p if and only if not-p' are contradictions; 'p implies not-p' is false when p is true and is equivalent to not-p.

  9. 9

    What is the negation of 'All swans are white'?

    • A

      No swan is white

    • B

      All swans are not white

    • Some swan is not white

    • D

      Some swan is white

    Negating a universal gives an existential with a negated predicate. 'No swan is white' is the contrary, which is much stronger than needed.

  10. 10

    How is 'Some students are lazy' symbolized in predicate logic (S = student, L = lazy)?

    • A

    • B

    • C

    Existentials pair with conjunction. is made true by anything that is not a student, so it says almost nothing.

  11. 11

    'I will pass only if I study' is correctly symbolized (P = pass, S = study) as...

    • B

    • C

    • D

    'A only if B' means A implies B: studying is necessary for passing, not sufficient. would say studying guarantees a pass.

  12. 12

    If it rains the match is cancelled; the match was not cancelled; so it did not rain. This argument is...

    • A

      invalid: it denies the antecedent

    • B

      invalid: it affirms the consequent

    • valid (modus tollens)

    • D

      valid, but only if it is not raining in the stadium

    The form is If P then Q; not Q; so not P. If rain guaranteed cancellation, no cancellation means no rain.

  13. 13

    If Maria is in Paris she is in France. Maria is in France. So Maria is in Paris. What is wrong?

    • A

      It denies the antecedent

    • It affirms the consequent

    • C

      It is an equivocation

    • D

      Nothing; it is valid

    Being in France does not imply being in Paris. Premises true, conclusion false is possible if she is in Lyon.

  14. 14

    Which statement is logically equivalent to ?

    • B

    • C

    • D

    A conditional is false only if p true and q false, exactly when is false. The converse and inverse are not equivalent.

  15. 15

    Which set of statements is inconsistent?

    • A

      , ,

    • B

      ,

    • , ,

    • D

      , ,

    From p and p→q we get q, contradicting not-q. The other sets can all be true together; for example p false and q false makes the set {p→q, not-p, not-q} true.

  16. 16

    An argument whose premises are inconsistent is...

    • A

      invalid, because the premises cannot be true

    • valid, but never sound

    • C

      sound only if the conclusion is true

    • D

      not an argument

    If the premises can never all be true, it is impossible for them to be true while the conclusion is false, so the argument is trivially valid. It cannot be sound.

  17. 17

    If is true, false and true, what is the truth value of ?

    • A

      True

    • B

      Cannot be determined

    • C

      True, because q is false

    • False

    is true; is false. A true antecedent with a false consequent makes the conditional false.

  18. 18

    Which pair is NOT equivalent?

    • A

      and

    • B

      and

    • and

    • D

      and

    A conditional and its converse are not equivalent (p false, q true separates them). The other pairs are contraposition, De Morgan and double negation.

  19. 19

    Which statement about Gödel's first incompleteness theorem (1931) is correct?

    • Any consistent, sufficiently strong formal system of arithmetic contains true statements it cannot prove

    • B

      All mathematical truths can be proved from a finite set of axioms

    • C

      Arithmetic is inconsistent

    • D

      Logic cannot express any arithmetic

    The theorem shows a limit on formal provability, not that mathematics is inconsistent.

  20. 20

    The logician pictured published the Begriffsschrift in 1879. What did it introduce?

    • Modern predicate logic with quantifiers

    • B

      Truth tables

    • C

      The syllogism

    • D

      Boolean circuit design

    Gottlob Frege's Begriffsschrift introduced quantifiers and variables, which let logic express statements such as 'for every x there is a y'. Truth tables came later (Wittgenstein and Post, around 1920); syllogisms are Aristotle's. Image: public domain, via Wikimedia Commons.

  21. 21

    Which gate can build every other logic gate by itself?

    • A

      AND

    • B

      XOR

    • C

      NOT alone

    • NAND

    NAND (and NOR) is functionally complete. AND, OR and XOR need extra gates, and NOT alone cannot form AND.