Satisfiable Formula (First-Order Logic)

first-order-logic

Definition

Satisfiable Formula (First-Order Logic)

A formula $\phi$ is satisfiable if there exists a structure $\mathcal{M}$ and a variable assignment $\ell$ such that $(\mathcal{M},\ell )\models \phi$.