quiz2 / module 2 Flashcards

(27 cards)

1
Q

logic

A

study of formal reasoning

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

proposition

A

any statement that is either true or false

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

propositional values

A

variables representing propositions

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

compound proposition

A

connecting propositions with logical operations;

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

logical operations

A

combines propositions with a rule

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

disjunction

A

or

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

conjuction

A

and

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

conditional operation

A

->; if p, then q; false if p is true and q is false

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

in p -> q…

A

p is the hypothesis and q is the conclusion

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

contrapositive

A

if notq, then notp

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

inverse

A

if notp, then notq

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

converse

A

if q, then p

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

biconditional operation

A

<->; p if and only if q; p iff q; only T if both are T or both are F

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

tautology

A

a compound proposition that is always true, regardless of individual propositions

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

contradiction

A

a compound proposition that is always false regardless of individual propositions

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

compund propositions are logically equivalent when

A

they have the same truth value; disregard individual/composing propositions

17
Q

De Morgan’s laws

A

not (p or q) = not p and not q; not (p and q) = notp or not q

18
Q

idempotent

A

p and p means p; p or p means p

19
Q

associative

A

(p or q) or r = p or (q or r); p and (q and r) = (p and q) and r

20
Q

commutative

A

p and/or q = q and/or p

21
Q

distributive

A

p and (q or r) = (p or q) and (p and r)

22
Q

identity

A

p or False = p; p and True = p

23
Q

domination

A

p and False = False; p or True = True

24
Q

double negation

A

not(not p) = p

25
complement laws
p and notp = F; p or notp = T
26
absorption
p or (p and q) = p; p and (p or q) = p
27
conditional identities
if p then q = (not p) or is q; p iff q = (if p then q) and (if q then p)