Some of the arguments are valid by universal

Chapter 3, Problem 14E

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

Problem 14E

Some of the arguments are valid by universal modus ponens or universal modus tollens; others are invalid and exhibit the converse or the inverse error. State which are valid and which are invalid. Justify your answers.

Universal Modus Ponens

The rule of universal instantiation can be combined with modus ponens to obtain the valid form of argument called universal modus ponens.

Universal Modus Ponens

Formal Version

Informal Version

x, if P(x) then Q(x).

If x makes P(x) true, then x makes Q(x) true.

P(a) for a particular a.

a makes P(x) true.

 ∴ Q(a).

 ∴a makes Q(x) true.

Universal ModusTollens

Another crucially important rule of inference is universal modus tollens.Its validity results from combining universal instantiation with modus tollens. Universal modus tollens is the heart of proof of contradiction, which is one of the most important methods of mathematical argument.

Universal Modus Tollens

Formal Version

Informal Version

x, if P(x) then Q(x).

If xmakes P(x) true, then xmakes Q(x) true.

~Q(a), for a particular a

a does not make Q(x) true.

∴ ~P(a).

 a does not make P(x) true.

Exercise

If compilation of a computer program produces error messages, then the program is not correct.

Compilation of this program does not produce error messages.

∴ This program is correct.

Questions & Answers

QUESTION:

Problem 14E

Some of the arguments are valid by universal modus ponens or universal modus tollens; others are invalid and exhibit the converse or the inverse error. State which are valid and which are invalid. Justify your answers.

Universal Modus Ponens

The rule of universal instantiation can be combined with modus ponens to obtain the valid form of argument called universal modus ponens.

Universal Modus Ponens

Formal Version

Informal Version

x, if P(x) then Q(x).

If x makes P(x) true, then x makes Q(x) true.

P(a) for a particular a.

a makes P(x) true.

 ∴ Q(a).

 ∴a makes Q(x) true.

Universal ModusTollens

Another crucially important rule of inference is universal modus tollens.Its validity results from combining universal instantiation with modus tollens. Universal modus tollens is the heart of proof of contradiction, which is one of the most important methods of mathematical argument.

Universal Modus Tollens

Formal Version

Informal Version

x, if P(x) then Q(x).

If xmakes P(x) true, then xmakes Q(x) true.

~Q(a), for a particular a

a does not make Q(x) true.

∴ ~P(a).

 a does not make P(x) true.

Exercise

If compilation of a computer program produces error messages, then the program is not correct.

Compilation of this program does not produce error messages.

∴ This program is correct.

ANSWER:

Solution:-

Step1

Given that

We have to state that which arguments are valid and which are invalid and Justify answers.

Step2

We can rewrite the premise as

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back