7 lines
159 B
Plaintext
7 lines
159 B
Plaintext
|
Adequacy/sufficiency/completeness of a set of boolean operators to
|
||
|
|
encode Boolean functions.
|
||
|
|
|
||
|
|
SAT is the set of satisfiable wffs
|
||
|
|
Complexity of SAT, P, NP
|
||
|
|
|