Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Math > M4S2 > Flashcards

M4S2 Flashcards

1
Q

“And” statement is TRUE only when

A

BOTH subsentences are TRUE.

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

An `or’ sentence is true when

A

at least

one of the subsentences is TRUE

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

An `exclusive-or’ statement is

true when

A

only one of the

subsentences is TRUE.

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

Converse proposition:

A

𝒒 → p

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

Inverse proposition:

A

~𝒑 → ~q

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

Contrapositive proposition:

A

~𝒒 → ~p

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

“If today is Thursday, then I have a test today.”

Converse:

A

“If I have a test today, then today is Thursday.”

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

“If today is Thursday, then I have a test today.”

Inverse:

A

“If today is not Thursday then I do not have test today.

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

“If today is Thursday, then I have a test today.”

Contrapositive:

A

“If I do not have a test today, then today is not Thursday.”

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

Two statements are equivalent in a biconditional statement when they

A

have the

SAME truth values.

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

Two statements are said to be logically equivalent if

A

they

have the same truth value for every possible cases.

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

𝒑 ∧ 𝑻== 𝒑

𝒑 ∨ 𝑭==𝒑

A

Identity laws

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

𝒑 ∨ 𝑻==𝑻

𝒑 ∧ 𝑭==𝑭

A

Domination laws

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

𝒑 ∨ 𝒑 <=> 𝒑

𝒑 ∧ 𝒑 <=> 𝒑

A

Idempotent laws

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

~(~𝒑) == 𝒑

A

Double negation laws

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

𝒑 ∨ 𝒒 <=> 𝒒 ∨ 𝒑

𝒑 ∧ 𝒒 <=> 𝒒 ∧ 𝒑

A

Commutative laws

17
Q

(𝒑 ∨ 𝒒) ∨ 𝒓

𝒑 ∨ (𝒒 ∨ 𝒓)

(𝒑 ∧ 𝒒 ) ∧ 𝒓

𝒑 ∧ (𝒒 ∧ 𝒓)

A

Associative laws

18
Q

𝒑 ∨ (𝒒 ∧ 𝒓)

(𝒑 ∨ 𝒒) ∧ (𝒑 ∨ 𝒓)

𝒑 ∧ (𝒒 ∨ 𝒓) <=> (𝒑 ∧ 𝒒) ∨ (𝒑 ∧ 𝒓)

A

Distributive laws

19
Q

~(𝒑 ∧ 𝒒 )<=> ~𝒑 ∨ ~𝒒

~(𝒑 ∨ 𝒒 ) <=> ~𝒑 ∧ ~𝒒

A

De Morgan’s laws

20
Q

– a compound proposition that is ALWAYS
TRUE, regardless of the truth values of the propositions
that occur in it.

A

Tautology

21
Q

a compound proposition that is ALWAYS

FALSE.

A

Contradiction

22
Q

– neither a tautology nor a contradiction

A

Contingency

Math (12 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions