# Definition:Model (Boolean Interpretations)

Jump to navigation
Jump to search

This page has been identified as a candidate for refactoring of basic complexity.In particular: Separate "one WFF" and "set of WFFs"Until this has been finished, please leave
`{{Refactor}}` in the code.
Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Refactor}}` from the code. |

## Definition

Let $\LL_0$ be the language of propositional logic.

Let $v: \LL_0 \to \set {\T, \F}$ be a boolean interpretation of $\LL_0$.

Then $v$ **models** a WFF $\phi$ if and only if:

- $\map v \phi = \T$

and this relationship is denoted as:

- $v \models_{\mathrm {BI} } \phi$

When pertaining to a collection of WFFs $\FF$, one says $v$ **models** $\FF$ if and only if:

- $\forall \phi \in \FF: v \models_{\mathrm {BI} } \phi$

that is, if and only if it **models** *all* elements of $\FF$.

This can be expressed symbolically as:

- $v \models_{\mathrm {BI}} \FF$

## Also denoted as

Often, when the formal semantics of a **model** is clear to be $\mathrm {BI}$, the formal semantics of boolean interpretations, the subscript is omitted, yielding:

- $v \models \phi$

## Also see

## Sources

- 1996: H. Jerome Keisler and Joel Robbin:
*Mathematical Logic and Computability*... (previous) ... (next): $\S 1.7$: Tableaus - 1998: David Nelson:
*The Penguin Dictionary of Mathematics*(2nd ed.) ... (previous) ... (next):**model**:**1.** - 2000: Michael R.A. Huth and Mark D. Ryan:
*Logic in Computer Science: Modelling and reasoning about systems*... (previous) ... (next): $\S 1.4.1$: The meaning of logical connectives - 2008: David Nelson:
*The Penguin Dictionary of Mathematics*(4th ed.) ... (previous) ... (next):**model**:**1.**