Problem 2
Write the negation of each conditional statement. If I am in Houston, then I am in Texas.
Problem 2
Construct a truth table for the given statement. \(\sim p \rightarrow q\)
Problem 2
a. Use a truth table to show that \(p \rightarrow q\) and \(\sim p \vee q\) are equivalent. b. Use the result from part (a) to write a statement that is equivalent to If a number is even, then it is divisible by \(2 .\)
Problem 3
Use Euler diagrams to determine whether each argument is valid or invalid. All clocks keep time accurately. All time-measuring devices keep time accurately. Therefore, all clocks are time-measuring devices.
Problem 3
Determine whether or not each sentence is a statement. On January 20, 2017, Hillary Clinton became America's 45 th president.
Problem 5
Determine whether or not each sentence is a statement. Take the most interesting classes you can find.
Problem 8
Use Euler diagrams to determine whether each argument is valid or invalid. All humans are warm-blooded. No reptiles are human. Therefore, no reptiles are warm-blooded.
Problem 10
Use Euler diagrams to determine whether each argument is valid or invalid. All comedians are funny people. Some funny people are professors. Therefore, some comedians are professors.
Problem 10
Let \(p\) and q represent the following simple statements: p: I study. \(q:\) I pass the course. Write each compound statement in symbolic form. I do not study or I do not pass the course.
Problem 11
Use a truth table to determine whether the symbolic form of the argument is valid or invalid. \(p \rightarrow q\) \(\frac{q \wedge r}{\therefore p \vee r}\)