Original: A formula of propositional logic is said to be satisfiable if logical values can be assigned to its variables in a way that makes the formula true .
Simplified: In propositional logic , a formula is satisfiable if the variables it uses can be given values so that it becomes true .