w4 - proposition logic Flashcards

1
Q

proposition meaning

A

A proposition is a statement which is either true or false.

1+1=2 - a proposition that is true

It will rain tommorow - a proposition

This statement is false - not a proposition
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Implication truth table

logically equiv to what?

A
P Q | P => Q
F F | T
F T | T
T F | F
T T | T

¬(P)∨Q

Think of a domino with p —- q.
If p falls, then q must fall (so if p=1, q must =1)
If q falls, p does not need to fall for this to be true

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

none or both of (equivalance)

A

“if and only if”

P Q | P <=> Q
F F | T
F T | F
T F | F
T T | T

P⇔Q = (P⇒Q)∧(Q⇒P)

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

tautology meaning

A

If a statement is a tautology, the right-hand column of its truth table has every entry True.

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

DNF (Disjunctive Normal Form) meaning

A

A Boolean expression is in Disjunctive Normal Form (DNF) if
* it is written as a disjunction of some number of parts, where
* each part is a conjunction of some number of literals

‘sum to product’ - each ‘and’ (conjunction) is connected by an or ‘disju

DNF is computational expensive (with k variables, there is 2^k rows in the truth table)

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

Conjunctive Normal Form (CNF)

A

A Boolean expression is in Conjunctive Normal Form (CNF) if
* it is written as a conjunction of some number of parts (sometimes called clauses), where
* each part is a disjunction of some number of literals.
* Called Clause

product to sum

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

convert DNF to CNF

A

Apply demorgan’s law twice

once to the overall not(P) and once to the individual clauses

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

“At least one of… must be true”

A

Combine them with OR

At least one of A, B, C, D
A∨B∨C∨D

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

” only if”

A

Implication

A only if B
A⇒B
¬A ∨B

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

“none or both of”

A

If and only if

None, or both, of A and B
A⇔B
(A⇒B)∧( B⇒A)
(¬A ∨B)∧(A ∨¬B)

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

“no more than one of”

A
  • Think of, can’t have any pairs in the set
  • Disallowing all possible pairs

no more than one of A, B, C
¬(A∧B)∧¬(A∧C)∧¬(D∧C)
(¬A∨¬B)∧(¬A∨¬C)∧¬(¬D∨¬C)

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

At most k are true

A
  • For every set of k+1 variables, at least one is false
  • Forbid any conjunction of k+1 variables to be true
  • Requires n choose k+1 clauses
Given J, M, K

At most one of:
(¬J ∨¬M)∧ (¬J∨¬K)∧(¬M∨¬K)

At most two of:
¬J∨¬M∨¬K

At most three of
Always 

write out n choose (k+1) clauses (which is conected by an and).
Then negate each literal

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

At least k are true

A

For eery set of n−k+1 at least one is true

Given J, M, K

At least one of:
J∨M∨K

At least two of:
(J ∨M)∧ (J∨K) ∧(M∨K)

At least three of:
J∧M∧K

write out n choose (n-k+1) clauses, which is connected by an ‘and’

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

Distributive law

A or (BC) =???

A

A or (BC)
(A or B) and (A and C)

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

Absorption law

A

A(A+B)=A

A+AB = A

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