1/19
Vocabulary practice flashcards covering logic fundamentals, truth tables, conditional statements, De Morgan's laws, quantifier negations, and argument validity.
Logical Equivalence
The condition where two logical statements share identical truth values across every line of a truth table, meaning the biconditional statement linking them, such as (∼p∧∼m)↔∼(p∨m), is always true (a tautology).
De Morgan's Law for Disjunction
The logical equivalence rule stating that the negation of a disjunction is the conjunction of the negations: ∼(p∨m)≡∼p∧∼m.
De Morgan's Law for Conjunction
The logical equivalence rule stating that the negation of a conjunction is the disjunction of the negations: ∼(p∧m)≡∼p∨∼m.
Conditional Statement (p→m)
An "if p then m" implication that is false only when the antecedent (p) is true and the consequent (m) is false; it is true in all other truth-value combinations.
Conditional Disjunctive Equivalence
The rule establishing that a conditional statement p→m is logically equivalent to the disjunction ∼p∨m.
Negation of a Conditional Statement
The logical assertion equivalent to asserting the hypothesis and denying the conclusion, written symbolically as ∼(p→m)≡p∧∼m.
Converse
A related conditional formed by reversing the antecedent and consequent of a direct statement; for p→m, the converse is m→p.
Contrapositive
A related conditional formed by reversing and negating both the antecedent and consequent of a direct statement; for p→m, the contrapositive is ∼m→∼p, which is logically equivalent to the original statement.
Inverse
A related conditional formed by negating both the antecedent and consequent of a direct statement without changing their order; for p→m, the inverse is ∼p→∼m.
Conjunction (p∧m)
An "and" statement that is true only when both constituent statements p and m are simultaneously true, and false in all other cases.
Disjunction (p∨m)
An "or" statement that is true when at least one constituent statement (p or m) is true, and false only when both p and m are false.
Biconditional Statement (p↔m)
An "if and only if" statement that is true whenever p and m share the exact same truth value (both true or both false) and false when their truth values differ.
Negation of Universal Quantifiers ("All")
The rule that the negation of "All A are B" is the existential statement "Some A are not B" (or at least one does not).
Negation of Existential Quantifiers ("Some")
The rule that the negation of "Some A are B" is the universal negative statement "No A are B" (or none).
Negation of Universal Negative Quantifiers ("No one" / "None")
The rule that the negation of "No one will call you that" or "No A are B" is the existential statement "Someone will call you that" or "Some A are B".
Negation of an Inequality
The logical complement of an inequality relation; for example, the negation of y≤7 is y>7.
Fallacy of the Converse
An invalid argument form (affirming the consequent) with the structure: p→m, m, therefore p.
Disjunctive Syllogism
A valid argument form stating that given a disjunction and the denial of one disjunct, the other disjunct must be true: p∨m, ∼p, therefore m.
Modus Tollens
A valid argument form (denying the consequent) stating that if a conditional holds and the consequent is false, the antecedent must also be false: p→m, ∼m, therefore ∼p.
Euler Diagram
A visual diagram using nested or overlapping closed regions to represent sets, class inclusions, and test the validity of categorical syllogisms and deductive arguments.