Exam #2 Flashcards

1
Q

Modus Ponens

A

P → Q
P
∴Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Modus Tollens

A

P→Q
¬Q
∴ ¬P

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Generalization

A

P
∴ P ∨ Q
Q
∴ P ∨ Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Specialization

A

P ∧ Q
∴ P
P ∧ Q
∴ Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Elimination

A

P ∨ Q
¬Q
∴ P
P ∨ Q
¬P
∴ Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Transitivity

A

P → Q
Q → R
∴ P → R

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Conjunction

A

P
Q
∴ P ∧ Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Argument

A

a sequence of statements called
premises, followed by a final statement called the
conclusion.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Valid Argument

A

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.)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Fallacies

A

errors in reasoning that result in invalid arguments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Divisibility

A

A nonzero integer m divides an integer n if there is
an integer q such that n = m · q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Proof

A

a convincing argument that some mathematical statement is true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Axiom

A

some mathematical statement that is generally accepted without proof

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Definition

A

an agreement about the meaning of a term

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Conjecture

A

a statement that we believe might be true but that have not yet proved

17
Q

Theorem

A

a mathematical statement for which we have a proof

18
Q

Lemma

A

a mathematical statement that was proven mainly to help with proving some theorem

19
Q

Congruence

A

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

20
Q

Methods of indirect proof

A

contrapositive and contradiction

21
Q

Parity Property

A

each integer is either even or odd (and not both)

22
Q

Negation of a conditional

A

¬(P→ Q) ≡ P ∧ ¬Q

23
Q

Contrapositive

A

P → Q ≡ ¬Q → ¬P