Discrete Structures Week 2 Flashcards

1
Q

logical operators

A

produce new propositions out of old ones
- negation
- conjunction
-disconjunction
-exclusive or
-conditional
-biconditional
- equivalence

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

logical equivalence

A

p and q are equivalent id they have the same truth table

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

contrapositive

A

p -> q =(3lines) not q then not p

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

p if q is a different way to say…

A

q then p

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

p only if q means

A

p is T only if q is T so
not q -> not p = p -> q

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

1st Morgan Law

A

not (p ^ q) = not p v not q

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

every logical operator is equivalent to…

A

one that is written only in terms of ^, v, not

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

two operators A and B are logically equivalents if and only if…

A

A is true whenever B is true and A is false whenever B is false

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

2nd De Morgan Law

A

not (p v q) = not p ^ not q
- proof for this

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

T is # and F is #
and how to solve these problems

A

T is 1, F is 0

  • compare is corresponding number with the operator
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Contrapositive

A

p -> q = not q -> not p

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

De Morgan Laws

A

not (p ^ q) = not p v not q
- prove by truth table

not (p v q) = not p ^ not q
- two propositions proof
p = q if P =T whenever q = T and p =F whenever q =F

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

Tautology

A

a compound propositions that is always true
p v not p

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

contradiction

A

a compound propositions that is always false
p ^ not p

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

contingency

A

a compound proposition that is neither false or true always
p

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

Argument

A

an assertion that gives some propositions P1…Pn (premises) imply another proposition q(conclusion)

17
Q

notation for arguments

A

P1…Pn |-> q

|-> is therefore

p1
p2
————-
three dots q

18
Q

valid

A

an argument p1…pn |-> q is valid (q=T) whenever p1…on are true

19
Q

fallacy

A

invalid
all premises (pn) are true but the conclusion(q) is false

20
Q

theorem of arguments

A

an argument p1…pn three dots is valid if and only if p1 ^p2^…^pn -> q is always true
- proof of this

21
Q

Modus Ponens

A

standard rules of inferences

p->q
p
——–
three dots q

22
Q

hypothetical syllogism

A

standard rules of inferences

p->q
q->r
———
three dots p->r