Definition:Satisfiable/Set of Formulas

From ProofWiki
Jump to navigation Jump to search


Let $\LL$ be a logical language.

Let $\mathscr M$ be a formal semantics for $\LL$.

A collection $\FF$ of logical formulas of $\LL$ is satisfiable for $\mathscr M$ if and only if:

There is some $\mathscr M$-model $\MM$ of $\FF$

That is, there exists some structure $\MM$ of $\mathscr M$ such that:

$\MM \models_{\mathscr M} \FF$

Also known as

Some sources refer to satisfiable as semantically consistent.

It is sometimes convenient to refer to satisfiability for $\mathscr M$ in a single adjective.

In such cases, $\mathscr M$-satisfiable is often seen.

Also see