Asked by Shanice Williams on May 26, 2024

verifed

Verified

Use a short form truth table to answer the following question.Which, if any, set of truth values assigned to the atomic sentences shows that the following argument is invalid? (E⋅∼H) ⊃G∼(H∨G) ∼E\begin{array} { l } ( \mathrm { E }\cdot \sim \mathrm { H } ) \supset \mathrm { G } \\\sim ( \mathrm { H } \vee \mathrm { G } ) \\\sim \mathrm { E }\end{array}(EH) G(HG) E

A) E: T H: T G: T
B) E: T H: T G: F
C) E: T H: F G: T
D) E: F H: F G: F
E) None-the argument is valid.

Atomic Sentences

The simplest type of sentences in logic, consisting of a single proposition without any logical connectives or additional propositions.

  • Be informed about the assembly and analysis of terse truth tables.
  • Examine the veracity of logical constructs through the lens of truth tables.
verifed

Verified Answer

AT
Abdel TaylorMay 30, 2024
Final Answer :
E
Explanation :
The argument is valid because there is no set of truth values for E, H, and G that makes all the premises true and the conclusion false. In a valid argument, it is impossible to have all true premises and a false conclusion.