×

Satisfiability

In mathematical logic, a formula is satisfiable if it is true under some assignment of values to its variables. For example, the formula {\displaystyle x+3=y} is satisfiable because it is true when x=3 and {\displaystyle y=6}, while the formula... Wikipedia