Definitions
Nearby Words

# Consistency

[kuhn-sis-tuhn-see] /kənˈsɪstənsi/

In logic, a theory is consistent if it does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if it has a model; this is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead. The syntactic definition states that a theory is consistent if there is no formula P such that both P and its negation are provable from the axioms of the theory under its associated deductive system.

If these semantic and syntactic definitions are equivalent for a particular logic, the logic is complete. The completeness of sentential calculus was proved by Paul Bernays in 1918 and Emil Post in 1921, while the completeness of predicate calculus was proved by Kurt Gödel in 1930. Stronger logics, such as second-order logic, are not complete.

A consistency proof is a mathematical proof that a particular theory is consistent. The early development of mathematical proof theory was driven by the desire to provide finitary consistency proofs for all of mathematics as part of Hilbert's program. Hilbert's program was strongly impacted by incompleteness theorems, which showed that sufficiently strong proof theories cannot prove their own consistency.

Although consistency can be proved by means of model theory, it is often done in a purely syntactical way, without any need to reference some model of the logic. The cut-elimination (or equivalently the normalization of the underlying calculus if there is one) implies the consistency of the calculus: since there is obviously no cut-free proof of falsity, there is no contradiction in general.

## Consistency and completeness

The fundamental results relating consistency and completeness were proven by Kurt Gödel:

• Gödel's completeness theorem shows that any consistent first-order theory is complete with respect to a maximal consistent set of formulae which are generated by means of a proof search algorithm.
• Gödel's incompleteness theorems show that theories capable of expressing their own provability relation and of carrying out a diagonal argument are capable of proving their own consistency only if they are inconsistent. Such theories, if consistent, are known as essentially incomplete theories.

By applying these ideas, we see that we can find first-order theories of the following four kinds:

1. Inconsistent theories, which have no models;
2. Theories which cannot talk about their own provability relation, such as Tarski's axiomatisation of point and line geometry, and Presburger arithmetic. Since these theories are satisfactorily described by the model we obtain from the completeness theorem, such systems are complete;
3. Theories which can talk about their own consistency, and which include the negation of the sentence asserting their own consistency. Such theories are complete with respect to the model one obtains from the completeness theorem, but contain as a theorem the derivability of a contradiction, in contradiction to the fact that they are consistent;
4. Essentially incomplete theories.

In addition, it has recently been discovered that there is a fifth class of theory, the self-verifying theories, which are strong enough to talk about their own provability relation, but are too weak to carry out Gödelian diagonalisation, and so which can consistently prove their own consistency. However as with any theory, a theory proving its own consistency provides us with no interesting information, since inconsistent theories also prove their own consistency.

## Formulas

A set of formulas $Phi$ in first-order logic is consistent (written Con$Phi$) if and only if there is no formula $phi$ such that $Phi vdash phi$ and $Phi vdash lnotphi$. Otherwise $Phi$ is inconsistent and is written Inc$Phi$.

$Phi$ is said to be simply consistent iff for no formula $phi$ of $Phi$ are both $phi$ and the negation of $phi$ theorems of $Phi$.

$Phi$ is said to be absolutely consistent or Post consistent iff at least one formula of $Phi$ is not a theorem of $Phi$.

$Phi$ is said to be maximally consistent if and only if for every formula $phi$, if Con $Phi cup phi$ then $phi in Phi$.

$Phi$ is said to contain witnesses if and only if for every formula of the form $exists x phi$ there exists a term $t$ such that $\left(exists x phi to phi \left\{t over x\right\}\right) in Phi$. See First-order logic.

### Basic results

1. The following are equivalent:

(a) Inc$Phi$

(b) For all $phi,; Phi vdash phi.$

2. Every satisfiable set of formulas is consistent, where a set of formulas $Phi$ is satisfiable if and only if there exists a model $mathfrak\left\{I\right\}$ such that $mathfrak\left\{I\right\} vDash Phi$.

3. For all $Phi$ and $phi$:

(a) if not $Phi vdash phi$, then Con$Phi cup \left\{lnotphi\right\}$;

(b) if Con $Phi$ and $Phi vdash phi$, then Con$Phi cup \left\{phi\right\}$;

(c) if Con $Phi$, then Con$Phi cup \left\{phi\right\}$ or Con$Phi cup \left\{lnot phi\right\}$.

4. Let $Phi$ be a maximally consistent set of formulas and contain witnesses. For all $phi$ and $psi$:

(a) if $Phi vdash phi$, then $phi in Phi$,

(b) either $phi in Phi$ or $lnot phi in Phi$,

(c) $\left(phi or psi\right) in Phi$ if and only if $phi in Phi$ or $psi in Phi$,

(d) if $\left(phitopsi\right) in Phi$ and $phi in Phi$, then $psi in Phi$,

(e) $exists x phi in Phi$ if and only if there is a term $t$ such that $phi\left\{t over x\right\}inPhi$.

### Henkin's theorem

Let $Phi$ be a maximally consistent set of formulas containing witnesses.

Define a binary relation on the set of S-terms $t_0 sim t_1 !$ if and only if $; t_0 = t_1 in Phi$; and let $overline t !$ denote the equivalence class of terms containing $t !$; and let $T_\left\{Phi\right\} := \left\{ ; overline t ; |; t in T^S \right\}$ where $T^S !$ is the set of terms based on the symbol set $S !$.

Define the S-structure $mathfrak T_\left\{Phi\right\}$ over $T_\left\{Phi\right\} !$ the term-structure corresponding to $Phi$ by:

(1) For $n$-ary $R in S$, $R^\left\{mathfrak T_\left\{Phi\right\}\right\} overline \left\{t_0\right\} ldots overline \left\{t_\left\{n-1\right\}\right\}$ if and only if $; R t_0 ldots t_\left\{n-1\right\} in Phi$,

(2) For $n$-ary $f in S$, $f^\left\{mathfrak T_\left\{Phi\right\}\right\} \left(overline \left\{t_0\right\} ldots overline \left\{t_\left\{n-1\right\}\right\}\right) := overline \left\{f t_0 ldots t_\left\{n-1\right\}\right\}$,

(3) For $c in S$, $c^\left\{mathfrak T_\left\{Phi\right\}\right\}:= overline c$.

Let $mathfrak I_\left\{Phi\right\} := \left(mathfrak T_\left\{Phi\right\},beta_\left\{Phi\right\}\right)$ be the term interpretation associated with $Phi$, where $beta _\left\{Phi\right\} \left(x\right) := bar x$.

$\left(*\right) ;$ For all $phi$,$; mathfrak I_\left\{Phi\right\} vDash phi$ if and only if $; phi in Phi$.

### Sketch of proof

There are several things to verify. First, that $sim$ is an equivalence relation. Then, it needs to be verified that (1), (2), and (3) are well defined. This falls out of the fact that $sim$ is an equivalence relation and also requires a proof that (1) and (2) are independent of the choice of $t_0, ldots ,t_\left\{n-1\right\}$ class representatives. Finally, $mathfrak I_\left\{Phi\right\} vDash Phi$ can be verified by induction on formulas.

## References

• The Cambridge Dictionary of Philosophy, consistency
• H.D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic
• Jevons, W.S., Elementary Lessons in Logic, 1870
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 86, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9408237338066101, "perplexity_flag": "head"}