Conjunction

- and
- Both statements need to be the same to be true

p ^ q = Minimum value(p,q)

Disjunction

- or
- At least one statement needs to be true to be true

p v q = Maximum value (p,q)

Conditional

- if then

If it’s sunny, I will wear sunscreen (1,1,1)

p>q=1

 if P less than or equal to q

1 less than or equal to 0

Biconditional

- both statements agree with each other

p = q, then p <- -> q

Exclusive

- O+
- P is not equal to q, then p O+ q = 1

Tautology

- P v not p
- always true
- Every output is 1 or always true

Contradiction

- p ^ not p
- Always false
- Every output is 0 or always false
Logic Laws

- we can use logicl equivalences to reduce complex formulas to simpler ones.

Identity Laws

- P ^ T <--> P
- P v F <--> P

Domination Laws

- P v T <--> T
- P ^ F <--> F

Double Negation

- Not not P <--> P

De Morgan’s Law

- not (p ^ q) <--> Not p v not q

- Not (p v q) <--> Not p ^ not q

Distributive Law

- P ^ (q v r) <--> (p ^ q) v (p ^ r)
- p v (q ^ r) <--> (p v q) ^ (p v r)
- 3 * (1 + 2)

Absorption Law

- p ^ (p v q) <--> P
- p v (p ^ q) <--> p

Commutativity (v, ^)

- p ^ q <--> q ^ p
- p v q <--> q v p
- Must only have one condition

Associativity (v, ^)

- p ^ (q ^ r) <--> (p ^ q) ^ r
 - Must only have one condition

Inverse Laws

- p ^ not p <--> F
- p v not p <--> T

Conditional Law

- P -> q <--> not p v q

- Equivalent in truth tables