Satisfiable.md (216B)
1 # Satisfiable 2 3 1.3.5 4 5 **Definition:** A proposition is satisfiable if there is some assignment of truth values to its variables such that the outcome is true. 6 7 We refer to this set of true variables as a 'solution'.
notesPersonal notes | |
| git clone git://git.laack.co/notes.git | |
| Log | Files | Refs |