Consistency

Absurdum

It is sometimes convenient to have a sentence, usually denoted by "$\perp$" and called falsum, absurdity or contradiction, and which is false in all structures for the language $\mathcal{L}$. We define $\perp$ by $\perp :=\phi \wedge \neg \phi$ for any sentence $\phi$. For example, $\phi$ can be taken to be $\forall x(x=x)$.

Consistency

A set of sentences $\Sigma$ is consistent if a contradiction cannot be derived from $\Sigma$. That is, if $\Sigma /⊢\perp$. $\Sigma$ is inconsistent if $\Sigma ⊢\perp$.

Soundness

If $\Sigma$ has a model then $\Sigma$ is consistent.

Consistency, Equivalent Versions

Suppose $\Sigma$ is a set of sentences in the language $\mathcal{L}$. Then $\begin{array}{rl}\Sigma \text{ is consistent}& ⟺\text{for every sentence }\phi ,\Sigma ⊬\phi \text{ or }\Sigma ⊬\neg \phi \\ & ⟺\text{for some sentence }\psi ,\Sigma ⊬\psi \\ & ⟺\Sigma ⊬\perp .\end{array}$ The set $\Sigma$ is inconsistent if it is not consistent. That is, $\begin{array}{rl}\Sigma \text{ is inconsistent}& ⟺\text{for some sentence }\phi ,\Sigma ⊢\phi \text{ and }\Sigma ⊢\neg \phi \\ & ⟺\text{for every sentence }\psi ,\Sigma ⊢\psi \\ & ⟺\Sigma ⊢\perp .\end{array}$

Properties of Consistency

Suppose $\Sigma$ is a set of sentences and $\sigma$ is a sentence.

1. $\Sigma$ is consistent iff every finite subset of $\Sigma$ is consistent;
2. If $\Sigma ⊢\sigma$ then $\Sigma \cup \{\sigma \}$ is consistent, but not conversely.
3. $\Sigma \cup \{\sigma \}$ is inconsistent iff $\Sigma ⊢\neg \sigma ,\Sigma \cup \{\sigma \}$ is consistent iff $\Sigma ⊬\neg \sigma$;
4. $\Sigma \cup \{\neg \sigma \}$ is inconsistent iff $\Sigma ⊢\sigma ,\Sigma \cup \{\neg \sigma \}$ is consistent iff $\Sigma ⊬\sigma$.