What is your answer?
An argument by Counter-Example:
{ 1 } - can show the conclusion of a sound argument to be false.
{ 2 } - requires more than one example.
{ 3 } - cannot be a contradiction of a universal affirmative proposition.
{ 4 } - cannot be a contradiction of a universal negative proposition.
{ 5 } - can prove that an inductive generalization is wrong.
<= back | menu | forward =>
Directions: Click on a number from 1 to 5.
1 is wrong. Please try again.
An argument by Counter-Example:
{ 1 } - can show the conclusion of a sound argument to be false.
{ 2 } - requires more than one example.
{ 3 } - cannot be a contradiction of a universal affirmative proposition.
{ 4 } - cannot be a contradiction of a universal negative proposition.
{ 5 } - can prove that an inductive generalization is wrong.
No, the conclusion of a sound argument is necessarily true.
<= back | menu | forward =>
2 is wrong. Please try again.
An argument by Counter-Example:
{ 1 } - can show the conclusion of a sound argument to be false.
{ 2 } - requires more than one example.
{ 3 } - cannot be a contradiction of a universal affirmative proposition.
{ 4 } - cannot be a contradiction of a universal negative proposition.
{ 5 } - can prove that an inductive generalization is wrong.
No, it requires only one counter-example to refute a universal statement.
<= back | menu | forward =>
3 is wrong. Please try again.
An argument by Counter-Example:
{ 1 } - can show the conclusion of a sound argument to be false.
{ 2 } - requires more than one example.
{ 3 } - cannot be a contradiction of a universal affirmative proposition.
{ 4 } - cannot be a contradiction of a universal negative proposition.
{ 5 } - can prove that an inductive generalization is wrong.
Yes, it can: "Some S is not P," a particular negative, contradicts "All S are P," a universal affirmative.
<= back | menu | forward =>
4 is wrong. Please try again.
An argument by Counter-Example:
{ 1 } - can show the conclusion of a sound argument to be false.
{ 2 } - requires more than one example.
{ 3 } - cannot be a contradiction of a universal affirmative proposition.
{ 4 } - cannot be a contradiction of a universal negative proposition.
{ 5 } - can prove that an inductive generalization is wrong.
Yes, it can: "Some S is a P," a particular affirmative, contradicts "No S is a P," a universal negative.
<= back | menu | forward =>
5 is correct!
An argument by Counter-Example:
{ 1 } - can show the conclusion of a sound argument to be false.
{ 2 } - requires more than one example.
{ 3 } - cannot be a contradiction of a universal affirmative proposition.
{ 4 } - cannot be a contradiction of a universal negative proposition.
{ 5 } - can prove that an inductive generalization is wrong.
An inductive generalization argues to a universal statement.
<= back | menu | forward =>
Before continuing, you might try some wrong answers.
the end