7.1-7.3 Flashcards

0
Q

Truth table

A

Used to determine the truth or falsity of a complicated statement based on the truth or falsity of its simple components

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

Two-valued logic

A

Every statement is either True or False.

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

Conjunction

A

“And”, true when both statements are true, ^

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

Disjunction

A

“Or”, true when @ least 1 statement is true, V

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

Negation

A

“Not”, ~

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

Inclusive “or”

A

Doing 1/other/both

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

When is p –> q not true?

A

When p is true and q is false

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

Tautology (rule of logic)

A

A formula which is “always true” - all the end results are true

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

P < – > q

A

Both P and Q r equivalent. True if P and Q are both true or both false

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

Contradiction

A

Opposite of a tautology, a formula which is “always false”

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

What are p and q called in p –> q?

A

p - hypothesis, q - conclusion

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

4 ways to rewrite a statement

A

1) If p, then q 2) Every p has q. 3) The fact that p, implies that q 4) p iff q

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

converse

A

q –> p

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

inverse

A

~p –> ~q

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

contrapositive

A

~q –> ~p

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

Direct Argument

A

p –> q p … q

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

Indirect Argument

A

p –> q ~q … ~p

18
Q

Chain Rule

A

p –> q q –> r … p –> r

19
Q

Or Rule

A

p V q ~p … q p V q ~q … p

20
Q

good definition

A

built from a true conditional with a true converse

21
Q

4 rules of biconditionals

A

p < – > q p …q p < –> q q … p p < –> q ~p … ~q p < – > q ~q … ~p

22
Q

When making a Venn diagram for a conditional, what goes into what?

A

hypothesis goes into conclusion

23
Q

Every statement is either True or False.

A

Two-valued logic

24
Q

Used to determine the truth or falsity of a complicated statement based on the truth or falsity of its simple components

A

Truth table

25
Q

“And”, true when both statements are true, ^

A

Conjunction

26
Q

“Or”, true when @ least 1 statement is true, V

A

Disjunction

27
Q

“Not”, ~

A

Negation

28
Q

Doing 1/other/both

A

Inclusive “or”

29
Q

When p is true and q is false

A

When is p –> q not true?

30
Q

A formula which is “always true” - all the end results are true

A

Tautology (rule of logic)

31
Q

Both P and Q r equivalent. True if P and Q are both true or both false

A

P < – > q

32
Q

Opposite of a tautology, a formula which is “always false”

A

Contradiction

33
Q

q –> p

A

converse

34
Q

~p –> ~q

A

inverse

35
Q

~q –> ~p

A

contrapositive

36
Q

p –> q p … q

A

Direct Argument

37
Q

p –> q ~q … ~p

A

Indirect Argument

38
Q

p –> q q –> r … p –> r

A

Chain Rule

39
Q

p V q ~p … q p V q ~q … p

A

Or Rule

40
Q

built from a true conditional with a true converse

A

good definition

41
Q

p < – > q p …q p < –> q q … p p < –> q ~p … ~q p < – > q ~q … ~p

A

4 rules of biconditionals