Exam #2 Flashcards
Modus Ponens
P → Q
P
∴Q
Modus Tollens
P→Q
¬Q
∴ ¬P
Generalization
P
∴ P ∨ Q
Q
∴ P ∨ Q
Specialization
P ∧ Q
∴ P
P ∧ Q
∴ Q
Elimination
P ∨ Q
¬Q
∴ P
P ∨ Q
¬P
∴ Q
Transitivity
P → Q
Q → R
∴ P → R
Conjunction
P
Q
∴ P ∧ Q
Argument
a sequence of statements called
premises, followed by a final statement called the
conclusion.
Valid Argument
An argument (or argument form) is valid if every
truth assignment that makes the premises true also makes
the conclusion true. (Otherwise, we say that the argument is
invalid.)
Fallacies
errors in reasoning that result in invalid arguments
Divisibility
A nonzero integer m divides an integer n if there is
an integer q such that n = m · q
Proof
a convincing argument that some mathematical statement is true
Axiom
some mathematical statement that is generally accepted without proof
Definition
an agreement about the meaning of a term
Conjecture
a statement that we believe might be true but that have not yet proved
Theorem
a mathematical statement for which we have a proof
Lemma
a mathematical statement that was proven mainly to help with proving some theorem
Congruence
Let n be an integer. If a and b are integers, then we say that a is congruent to b modulus n provided that n divides a-b
Methods of indirect proof
contrapositive and contradiction
Parity Property
each integer is either even or odd (and not both)
Negation of a conditional
¬(P→ Q) ≡ P ∧ ¬Q
Contrapositive
P → Q ≡ ¬Q → ¬P