Skip to main content
Logo image

Elementary Foundations: An introduction to topics in discrete mathematics

Jeremy Sylvestre

🔗

Activities 5.4 Activities
A4US

🔗

Activity 5.1.

🔗
🔗

(a)

🔗
Write an argument in English that has modus ponens form where at least one premise is false, and the conclusion is true.
🔗
Does your argument contradict the fact that every modus ponens argument is valid?
🔗

(b)

🔗
Write an argument in English that has modus tollens form where at least one premises is false and the conclusion is false. Does your argument contradict the fact that every modus tollens argument is valid?
🔗

(c)

🔗
Write an argument in English that has syllogistic form where all the premises are true. Is your conclusion true or false?
🔗

Activity 5.2.

🔗
🔗
Prove that modus tollens is valid without using a truth table. Instead, use the following facts:
  • 🔗
    modus ponens is valid; and
  • 🔗
    a conditional is equivalent to its contrapositive.
🔗

Activity 5.3.

🔗
Discuss why an argument being valid is equivalent to its premises logically implying its conclusion.
🔗

Activity 5.4.

🔗
The definition of valid argument is as follows.
🔗
Whenever the premises are all true, the conclusion is true as well.
🔗
Create an equivalent definition that is the contrapositive of the definition above.
🔗

Activity 5.5.

🔗
Show that the following argument is valid without using a truth table. Instead, argue that the argument fulfills the equivalent definition for valid argument that you created in Activity 5.4.
p→¬q
r→(p∧q)
¬r
<Prev^TopNext>