Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
49 Cards in this Set
- Front
- Back
conditional statement (antecedent) |
the statement immediately following the "if"
|
|
conditional statement (consequent) |
the statement immediately following the "then" |
|
deductive argument |
an argument is deductive if and only if the conclusion is claimed to follow the premises with logical necessity |
|
inductive argument |
an argument is inductive if and only if the conclusion is claimed to follow the premises with logical probability |
|
argument based on mathmatics |
an argument where the conclusion can be solved using math but NOT statistics |
|
argument from definition |
an argument where the conclusion can be formed from a word's definition |
|
categorical syllogism |
an argument that contains all, no, or some |
|
hypothetical syllogism |
P1: if p, then q P2: if q, then r C: if p, then r |
|
modus ponens |
P1: if p, then q P2: p C: q |
|
modus tollens |
P1: if p, then q P2: not q C: not p |
|
Denying the Antecedant |
P1: If p, then q P2: not p C: not q |
|
Affirming the Consequent |
P1: If p, then q P2: q C: p |
|
Disjunctive Syllogism (version 1) |
P1: Either p or q P2: not p C: q |
|
Disjunctive Syllogism (version 2) |
P1: Either p or q P2: not q C: p |
|
Constructive Dilemma |
P1: If p, then q P2: If r, then s P3: Either p or r C: Either q or s |
|
Destructive Dilemma |
P1: If p, then q P2: If r, then s P3: Either not q or not s C: Either not p or not r |
|
Prediction |
an argument where the conclusion says something about the future |
|
Argument from Analogy |
If Sarah's car has good gas mileage, then Betty's car must have god gas mileage. |
|
Generalization |
Because 10 grapes out of a bag are juicy, then all the grapes in the bag must be juicy. |
|
Argument from Authority |
the conclusion is made based on what an authoritative figure said |
|
Argument based on Signs |
the conclusion is made based on what is written on a sign |
|
Causal Inference |
The child is sleeping, therefore he must have has a tiring day. |
|
valid deductive argument |
a deductive argument is valid if and only if the conclusion follows premises with logical necessity |
|
invalid deductive argument |
a deductive argument is invalid if and only if the conclusion follows premises with logical probability |
|
sound argument |
a valid deductive argument that has all true premises |
|
strong inductive argument |
an inductive argument is strong if and only if the conclusion follows the premises with logical probability |
|
weak inductive argument |
and inductive argument is weak if and only if the conclusion does not follow the premises with logical probability |
|
cogent argument |
a strong inductive argument that has all true premises |
|
argument form |
an arrangement of words and letters such that the uniform substitution of terms or statements in place of letters results in an argument
|
|
substitution instance |
an argument or statement that has the same form as a given argument form or statement form |
|
simple statement |
a statement is simple if and only if it does NOT contain any other statements as a component |
|
compound statement |
a statement is compound if and only if it contains at least one simple statement as a component |
|
well formed formula |
a well formed formula is a syntactically correct arrangement of symbols, such as upper case letters, operators, logical punctuation, and logical variables |
|
main operator |
the main operator is the operator that determines the overall structure of the WFF |
|
subformula |
a subformula is any part of a WFF |
|
Tautology (statement form) |
a statement form is a tautology if and only if it is true for every substitution instance |
|
tautology (statement) |
a statement is a tautology if and only if it is a substitution instance of a tautologous form |
|
self-contradiction (statement form) |
a statement form is a self-contradiction if and only if it is false for every substitution instance |
|
self-contradiction (statement) |
a statement is a self-contradiction if and only if it is a substitution instance of a self-contradictory form |
|
contingency (statement form) |
a statement form is a contingency if and only if it is true for at least one substitution instance and false for at least one substitution instance. |
|
contingency (statement) |
a statement is a contingency if and only if it is a substitution instance of a contingent form |
|
logical equivalence (statement form) |
two statement forms are logically equivalent if and only if the two final columns of their joint truth table are identical |
|
logical equivalence (statements) |
two statements are logically equivalent if and only if they are substitution instances of logically equivalent forms |
|
inconsistency (statement forms) |
two statement forms are inconsistent if and only if there is NO line in the final columns of their joint truth table on which both forms have the T truth value |
|
inconsistency (statements) |
two statements are inconsistent if and only if the are substitution instances of inconsistent forms |
|
consistency (statement forms) |
two statement forms are consistent if and only if there is at least one line in the final columns of their joint truth table on which both forms have the T truth value |
|
consistency (statements) |
two statements are consistent if and only if they are substitution instances of consistent forms |
|
logical implication (statement forms) |
one statement form logically implies another form if and only if there is no line in the final columns of their joint truth table on which the first form has the T truth value, while the second has the F truth value |
|
logical implication (statements) |
one statement logical implies another statement if and only if they are substitution instances of implicative forms |