Untitled Flashcards Set

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/24

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

25 Terms

1
New cards
Argument
A sequence of statements leading to a conclusion.
2
New cards
Valid Argument
A conclusion that logically follows from true hypotheses.
3
New cards
Proof
A valid argument.
4
New cards
Fallacy
An invalid argument.
5
New cards
Axiom (Postulate, Law)
A statement assumed to be true.
6
New cards
Conjecture
A statement proposed to be true.
7
New cards
Theorem
A statement proven to be true.
8
New cards
Lemma
A preliminary theorem.
9
New cards
Corollary
A theorem that follows directly from another theorem.
10
New cards
Modus Ponens
If p→q and p is true, then q is true.
11
New cards
Universal Modus Ponens
If 'All x have property P', and a is an x, then a has property P.
12
New cards
Universal Modus Tollens
If 'All x have property P', but a does not have P, then a is not an x.
13
New cards
Vacuous Proof
Proving p→q by showing p is false.
14
New cards
Trivial Proof
Proving p→q by showing q is always true.
15
New cards
Direct Proof

Assuming hyposthesis and logically deriving conclusion.

16
New cards
Indirect Proof (Contraposition)

Assume the conclusion is false, and show this means

the hypothesis is false (i.e. Prove the contrapositive.)
(Proving p→q by proving ¬q→¬p.)

17
New cards
Proof by Contradiction

To show P is true, assume P is false, and show this

results to a contradiction (i.e. a false statement).is not possible, thereby proving P must be true.

18
New cards
Proof of Equivalence
Proving p↔q by proving both p→q and q→p.
19
New cards
Proof by Counterexample

Showing that a universal claim is false by finding a counterexample.
(“For all x, P(x)” is false, find a c where P(c)=false)

20
New cards
Constructive Proof
Explicitly finding an example to prove existence.
21
New cards
Non-Constructive Proof

Proving existence without identifying an example.
(Show that for every positive integer n,

there is a prime bigger than n.)

22
New cards
Uniqueness Proof
Proving that a solution exists and is unique.
23
New cards
Exhaustive Proof
Checking all possible cases.
24
New cards
Proof by Cases
Breaking a proof into multiple scenarios.
25
New cards
Pigeonhole Principle
If k+1 objects are placed into k containers, at least one container has more than one object.