Chapter 2 Terms Flashcards

1
Q

Conditional Statement

A

A conditional statement is a logical statement that has 2 parts, a hypothesis (p) and a conclusion (q). When a conditional statement is written in if-then form, the “if” part contains the hypothesis and the “then” part contains the conclusion

If p, then q

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

Negation

A

The negation of a statement is the opposite of the original statement. To write the negation of statement p, you write the symbol for negation (~) before the letter

~p

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

Converse

A

To write the converse of a conditional statement, exchange the hypothesis and the conclusion

If q, then p

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

Inverse

A

To write the inverse of a conditional statement, negate both the hypothesis and the conclusion

If not p, then not q

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

Contrapositive

A

To write the contrapositive of a conditional statement, first write the converse, then negate both the hypothesis and the conclusion

If not q, then not p

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

Biconditional Statement

A

When a conditional statement and its converse are both true, you can write them as a single biconditional statement. A biconditional statement is a statement that contains the phrase “if and only if”

p if and only if q

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

Inductive Reasoning

A

A conjecture is an unproven statement that is based on observations

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

Counterexample

A

To show that a conjecture is true, you must show that it is true for all cases. You can show that a conjecture is false, however, by finding just one counterexample. A counterexample is a specific case for which the conjecture is false.

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

Deductive Reasoning

A

Deductive reasoning uses facts, definitions, accepted properties, and the laws of logic to form a logical argument. This is different from inductive reasoning, which uses specific examples and patterns to form a conjecture.

more info on page 76

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

Reflexive Property

A

a = a

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

Symmetric Property

A

If a = b, then b = a

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