Revision theory is a subfield of philosophical logic. It consists of a general theory of definitions, including (but not limited to) circular and interdependent concepts. A circular definition is one in which the concept being defined occurs in the statement defining it—for example, defining a G as being blue and to the left of a G. Revision theory provides formal semantics for defined expressions, and formal proof systems study the logic of circular expressions.

Definitions are important in philosophy and logic. Although circular definitions have been regarded as logically incorrect or incoherent, revision theory demonstrates that they are meaningful and can be studied with mathematical and philosophical logic. It has been used to provide circular analyses of philosophical and logical concepts.

History

Revision theory is a generalization of the revision theories of truth developed by Anil Gupta, Hans Herzberger, and Nuel Belnap.^[1] In the revision theories of Gupta and Herzberger, revision is supposed to reflect intuitive evaluations of sentences that use the truth predicate. Some sentences are stable in their evaluations, such as the truth-teller sentence,

The truth-teller is true.

Assuming the truth-teller is true, it is true, and assuming that it is false, it is false. Neither status will change. On the other hand, some sentences oscillate, such as the liar,

The liar sentence is not true.

On the assumption that the liar is true, one can show that it is false, and on the assumption that it is false, one can show that it is true. This instability is reflected in revision sequences for the liar.

The generalization to circular definitions was developed by Gupta, in collaboration with Belnap. Their book, The Revision Theory of Truth, presents an in-depth development of the theory of circular definitions, as well as an overview and critical discussion of philosophical views on truth and the relation between truth and definition.

Philosophical background

The philosophical background of revision theory is developed by Gupta and Belnap.^[2] Other philosophers, such as Aladdin Yaqūb, have developed philosophical interpretations of revision theory in the context of theories of truth, but not in the general context of circular definitions.^[3]

Gupta and Belnap maintain that circular concepts are meaningful and logically acceptable. Circular definitions are formally tractable, as demonstrated by the formal semantics of revision theory. As Gupta and Belnap put it, "the moral we draw from the paradoxes is that the domain of the meaningful is more extensive than it appears to be, that certain seemingly meaningless concepts are in fact meaningful."^[4]

The meaning of a circular predicate is not an extension, as is often assigned to non-circular predicates. Its meaning, rather, is a rule of revision that determines how to generate a new hypothetical extension given an initial one. These new extensions are at least as good as the originals, in the sense that, given one extension, the new extension contains exactly the things that satisfy the definiens for a particular circular predicate. In general, there is no unique extension on which revision will settle.^[5]

Revision theory offers an alternative to the standard theory of definitions. The standard theory maintains that good definitions have two features. First, defined symbols can always be eliminated, replaced by what defines them. Second, definitions should be conservative in the sense that adding a definition should not result in new consequences in the original language. Revision theory rejects the first but maintains the second, as demonstrated for both of the strong senses of validity presented below.

The logician Alfred Tarski presented two criteria for evaluating definitions as analyses of concepts: formal correctness and material adequacy. The criterion of formal correctness states that in a definition, the definiendum must not occur in the definiens. The criterion of material adequacy says that the definition must be faithful to the concept being analyzed. Gupta and Belnap recommend siding with material adequacy in cases in which the two criteria conflict.^[6] To determine whether a circular definition provides a good analysis of a concept requires evaluating the material adequacy of the definition. Some circular definitions will be good analyses, while some will not. Either way, formal correctness, in Tarski's sense, will be violated.

Semantics for circular predicates

The central semantic idea of revision theory is that a definition, such as that of being a ${\displaystyle G}$, provides a rule of revision that tells one what the new extension for the definiendum ${\displaystyle G}$ should be, given a hypothetical extension of the definiendum and information concerning the undefined expressions. Repeated application of a rule of revision generates sequences of hypotheses, which can be used to define logics of circular concepts. In work on revision theory, it is common to use the symbol, ${\displaystyle =_{df}}$, to indicate a definition, with the left-hand side being the definiendum and the right-hand side the definiens. The example

Being a ${\displaystyle G}$ is defined as being both blue and to the left of a ${\displaystyle G}$

can then be written as

Being a ${\displaystyle G=_{df}}$ being both blue and to the left of a ${\displaystyle G}$.

Given a hypothesis about the extension of ${\displaystyle G}$, one can obtain a new extension for ${\displaystyle G}$ appealing to the meaning of the undefined expressions in the definition, namely blue and to the left of.

We begin with a ground language, ${\displaystyle L}$, that is interpreted via a classical ground model ${\displaystyle M}$, which is a pair of a domain ${\displaystyle D}$ and an interpretation function ${\displaystyle I}$.^[7] Suppose that the set of definitions ${\displaystyle {\mathcal {D}}}$ is the following,

${\displaystyle {\begin{aligned}G_{1}{\overline {x}}&=_{Df}A_{G_{1}}({\overline {x}})\\&{}\,\,\,\vdots \\G_{n}{\overline {x}}&=_{Df}A_{G_{n}}({\overline {x}})\\&{}\,\,\,\vdots \end{aligned}}}$

where each ${\displaystyle A_{G_{i}}}$ is a formula that may contain any of the definienda ${\displaystyle G_{j}}$, including ${\displaystyle G_{i}}$ itself. It is required that in the definitions, only the displayed variables, ${\displaystyle {\overline {x}}}$, are free in the definientia, the formulas ${\displaystyle A_{G_{i}}}$. The language is expanded with these new predicates, ${\displaystyle G_{1},\ldots ,G_{n},\ldots }$, to form ${\displaystyle L}$⁺. When the set ${\displaystyle {\mathcal {D}}}$ contains few defined predicates, it is common to use the notation, ${\displaystyle G{\overline {x}}=_{Df}A({\overline {x}},G)}$ to emphasize that ${\displaystyle A}$ may contain ${\displaystyle G}$.

A hypothesis ${\displaystyle h}$ is a function from the definienda of to tuples of ${\displaystyle {\mathcal {D}}}$. The model ${\displaystyle M+h}$ is just like the model ${\displaystyle M}$ except that ${\displaystyle h}$ interprets each definiendum according to the following biconditional, the left-hand side of which is read as “${\displaystyle G_{i}({\overline {t}})}$ is true in ${\displaystyle M+h}$.”

${\displaystyle M+h\models G_{i}({\overline {t}}){\text{ iff }}I({\overline {t}})\in h(G_{i})}$

The set ${\displaystyle {\mathcal {D}}}$ of definitions yields a rule of revision, or revision operator, ${\displaystyle \delta _{M,{\mathcal {D}}}}$. Revision operators obey the following equivalence for each definiendum, ${\displaystyle G}$, in ${\displaystyle {\mathcal {D}}}$.

${\displaystyle M+\delta _{M,{\mathcal {D}}}(h)\models G({\overline {t}}){\text{ iff }}M+h\models A_{G}({\overline {t}})}$

A tuple will satisfy a definiendum ${\displaystyle G}$ after revision just in case it satisfies the definiens for ${\displaystyle G}$, namely ${\displaystyle A_{G}}$, prior to revision. This is to say that the tuples that satisfy ${\displaystyle A_{G}}$ according to a hypothesis will be exactly those that satisfy ${\displaystyle G}$ according to the revision of that hypothesis.

The classical connectives are evaluated in the usual, recursive way in ${\displaystyle M+h}$. Only the evaluation of a defined predicate appeals to the hypotheses.

Sequences

Revision sequences are sequences of hypotheses satisfying extra conditions.^[8] We will focus here on sequences that are ${\displaystyle \omega }$-long, since transfinite revision sequences require the additional specification of what to do at limit stages.

Let ${\displaystyle {\mathcal {S}}}$ be a sequence of hypotheses, and let ${\displaystyle {\mathcal {S}}_{\alpha }}$ be the ${\displaystyle \alpha }$-th hypothesis in ${\displaystyle {\mathcal {S}}}$. An ${\displaystyle \omega }$-long sequence ${\displaystyle {\mathcal {S}}}$ of hypotheses is a revision sequence just in case for all ${\displaystyle n}$,

${\displaystyle {\mathcal {S}}_{n+1}=\delta _{M,{\mathcal {D}}}({\mathcal {S}}_{n}).}$

Recursively define iteration as

• ${\displaystyle \delta _{M,{\mathcal {D}}}^{0}(h)=h}$ and
• ${\displaystyle \delta _{M,{\mathcal {D}}}^{n+1}(h)=\delta _{M,{\mathcal {D}}}^{n}(\delta _{M,{\mathcal {D}}}(h)).}$

The ${\displaystyle \omega }$-long revision sequence starting from ${\displaystyle h}$ can be written as follows.

${\displaystyle h,\delta _{M,{\mathcal {D}}}(h),\delta _{M,{\mathcal {D}}}^{2}(h),\ldots }$

One sense of validity, ${\displaystyle S_{0}}$ validity, can be defined as follows. A sentence ${\displaystyle A}$ is valid in ${\displaystyle S_{0}}$ in ${\displaystyle M}$ on ${\displaystyle {D}}$ iff there exists an ${\displaystyle n}$ such that for all ${\displaystyle h}$ and for all ${\displaystyle m\geq n}$, ${\displaystyle M+\delta _{M,{\mathcal {D}}}^{m}(h)\models A}$. A sentence ${\displaystyle A}$ is valid on ${\displaystyle D}$ just in case it is valid in all ${\displaystyle M}$.

Validity in ${\displaystyle S_{0}}$ can be recast in terms of stability in ${\displaystyle \omega }$-long sequences. A sentence ${\displaystyle A}$ is stably true in a revision sequence just in case there is an ${\displaystyle {\alpha }}$ such that for all ${\displaystyle \beta \geq \alpha }$, ${\displaystyle M+{{\mathcal {S}}_{\beta }}\models A}$. A sentence ${\displaystyle A}$ is stably false in a revision sequence just in case there is an ${\displaystyle {\alpha }}$ such that for all ${\displaystyle \beta \geq \alpha }$, ${\displaystyle M+{{\mathcal {S}}_{\beta }}\not \models A}$. In these terms, a sentence ${\displaystyle A}$ is valid in ${\displaystyle S_{0}}$ in ${\displaystyle M}$ on just in case ${\displaystyle A}$ is stably true in all ${\displaystyle \omega }$-long revision sequences on ${\displaystyle M}$.

Examples

For the first example, let ${\displaystyle {\mathcal {D}}_{1}}$ be ${\displaystyle Gx=_{Df}(x=a\ \&\ \sim Gx)\lor (x=b\ \&\ Gb).}$ Let the domain of the ground model ${\displaystyle M}$ be {a, b} , and let ${\displaystyle I(a)=a}$ and ${\displaystyle I(b)=b}$. There are then four possible hypotheses for ${\displaystyle M}$: ${\displaystyle \emptyset }$, {a} , {b} , {a, b} . The first few steps of the revision sequences starting from those hypotheses are illustrated by the following table.

Sample revision for ${\displaystyle {\mathcal {D}}_{1}}$

stage 0	stage 1	stage 2	stage 3
${\displaystyle \emptyset }$	{a}	${\displaystyle \emptyset }$	{a}
{a}	${\displaystyle \emptyset }$	{a}	${\displaystyle \emptyset }$
{b}	{a, b}	{b}	{a, b}
{a, b}	{b}	{a, b}	{b}

As can be seen in the table, ${\displaystyle a}$ goes in and out of the extension of ${\displaystyle G}$. It never stabilizes. On the other hand, ${\displaystyle b}$ either stays in or stays out. It is stable, but whether it is stably true or stably false depends on the initial hypothesis.

Next, let ${\displaystyle {\mathcal {D}}_{2}}$ be ${\displaystyle Hx=_{Df}Hx\lor \sim Hx.}$ As shown in the following table, all hypotheses for the ground model of the previous example are revised to the set {a, b} .

Sample revision for ${\displaystyle {\mathcal {D}}_{2}}$

stage 0	stage 1	stage 2	stage 3
${\displaystyle \emptyset }$	{a, b}	{a, b}	{a, b}
{a}	{a, b}	{a, b}	{a, b}
{b}	{a, b}	{a, b}	{a, b}
{a, b}	{a, b}	{a, b}	{a, b}

For a slightly more complex revision pattern, let ${\displaystyle {L}}$ contain ${\displaystyle <}$ and all the numerals, ${\displaystyle {\overline {k}}}$, and let the ground model be ${\displaystyle \mathbb {N} }$, whose domain is the natural numbers, ${\displaystyle \omega }$, with interpretation ${\displaystyle I}$ such that ${\displaystyle I({\overline {k}})=k}$ for all numerals and ${\displaystyle I(<)}$ is the usual ordering on natural numbers. Let ${\displaystyle {\mathcal {D}}_{3}}$ be ${\displaystyle Jx=_{Df}\forall y(y<x\supset Jy).}$ Let the initial hypothesis ${\displaystyle h}$ be ${\displaystyle \emptyset }$. In this case, the sequence of extensions builds up stage by stage.

${\displaystyle \varnothing ,\ \{0\},\ \{0,1\},\ \{0,1,2,\},\ \ldots }$

Although for every ${\displaystyle n}$, ${\displaystyle J{\overline {n}}}$ is valid in ${\displaystyle \mathbb {N} }$, ${\displaystyle \forall xJx}$ is not valid in ${\displaystyle \mathbb {N} }$.

Suppose the initial hypothesis contains 0, 2, and all the odd numbers. After one revision, the extension of ${\displaystyle J}$ will be {0, 1, 2, 3, 4} . Subsequent revisions will build up the extension as with the previous example. More generally, if the extension of ${\displaystyle J}$ is not all of ${\displaystyle \mathbb {N} }$, then one revision will cut the extension of ${\displaystyle J}$ down to a possibly empty initial segment of the natural numbers and subsequent revisions will build it back up.

Proof system

There is a Fitch-style natural deduction proof system, ${\displaystyle C_{0}}$, for circular definitions.^[9] The system uses indexed formulas, ${\displaystyle {A}^{i}}$, where ${\displaystyle i}$ can be any integer. One can think of the indices as representing relative position in a revision sequence. The premises and conclusions of the rules for the classical connectives all have the same index. For example, here are the conjunction and negation introduction rules.

| ${\displaystyle B^{i}}$
| ${\displaystyle C^{i}}$
| ${\displaystyle (B\&C)^{i}}$ ${\displaystyle \&}$In

| |__ ${\displaystyle B^{i}}$
| | ${\displaystyle \vdots }$
| | ${\displaystyle \bot ^{i}}$
| ${\displaystyle \sim B^{i}}$ ${\displaystyle \sim }$In

For each definition, ${\displaystyle G{\overline {x}}=_{Df}A_{G}({\overline {x}})}$, in ${\displaystyle D}$, there is a pair of rules.

| ${\displaystyle A_{G}({\overline {t}})^{i}}$
| ${\displaystyle G({\overline {t}})^{i+1}}$ DfIn

| ${\displaystyle G({\overline {t}})^{i+1}}$
| ${\displaystyle A_{G}({\overline {t}})^{i}}$ DfElim

In these rules, it is assumed that ${\displaystyle {\overline {t}}}$ are free for ${\displaystyle {\overline {x}}}$ in ${\displaystyle A_{G}}$.

Finally, for formulas ${\displaystyle B}$ of ${\displaystyle {L}}$, there is one more rule, the index shift rule.

| ${\displaystyle B^{i}}$
| ${\displaystyle B^{j}}$ IS

In this rule, ${\displaystyle i}$ and ${\displaystyle j}$ can be any distinct indices. This rule reflects the fact that formulas from the ground language do not change their interpretation throughout the revision process.

The system ${\displaystyle C_{0}}$ is sound and complete with respect to ${\displaystyle S_{0}}$ validity, meaning a sentence is valid in ${\displaystyle S_{0}}$ just in case it is derivable in ${\displaystyle C_{0}}$.

Recently Riccardo Bruni has developed a Hilbert-style axiom system and a sequent system that are both sound and complete with respect to ${\displaystyle S_{0}}$.^[10]

Transfinite revision

For some definitions, ${\displaystyle S_{0}}$ validity is not strong enough.^[11] For example, in definition ${\displaystyle {\mathcal {D}}_{3}}$, even though every number is eventually stably in the extension of ${\displaystyle J}$, the universally quantified sentence ${\displaystyle \forall xJx}$ is not valid. The reason is that for any given sentence to be valid, it must stabilize to true after finitely many revisions. On the other hand, ${\displaystyle \forall xJx}$ needs infinitely many revisions, unless the initial hypothesis already assigns all the natural numbers as the extension of ${\displaystyle J}$.

Natural strengthenings of ${\displaystyle S_{0}}$ validity, and alternatives to it, use transfinitely long revision sequences. Let ${\displaystyle On}$ be the class of all ordinals. The definitions will focus on sequences of hypotheses that are ${\displaystyle On}$-long.

Suppose ${\displaystyle {\mathcal {S}}}$ is an ${\displaystyle On}$-long sequence of hypotheses. A tuple ${\displaystyle {\overline {d}}}$ is stably in the extension of a defined predicate ${\displaystyle G}$ at a limit ordinal ${\displaystyle \beta }$ in a sequence ${\displaystyle {\mathcal {S}}}$ just in case there is an ${\displaystyle \alpha \leq \beta }$ such that for all ${\displaystyle \gamma }$ with ${\displaystyle \alpha \leq \gamma <\beta }$, ${\displaystyle {\overline {d}}\in {\mathcal {S}}_{\gamma }}$. Similarly, a tuple ${\displaystyle {\overline {d}}}$ is stably out of the extension of ${\displaystyle G}$ at a limit ordinal ${\displaystyle \beta }$ just in case there is a stage ${\displaystyle \alpha }$ such that for all ${\displaystyle \gamma }$ with ${\displaystyle \alpha \leq \gamma <\beta }$, ${\displaystyle {\overline {d}}\not \in {\mathcal {S}}_{\gamma }}$. Otherwise ${\displaystyle {\overline {d}}}$ is unstable at ${\displaystyle \beta }$ in ${\displaystyle {\mathcal {S}}}$. Informally, a tuple is stably in an extension at a limit, just in case there's a stage after which the tuple is in the extension up until the limit, and a tuple is stably out just in case there's a stage after which it remains out going to the limit stage.

A hypothesis ${\displaystyle h}$ coheres with ${\displaystyle {\mathcal {S}}}$ at a limit ordinal ${\displaystyle \beta }$ iff for all tuples ${\displaystyle {\overline {d}}}$, if ${\displaystyle {\overline {d}}}$ is stably in [stably out of] the extension of ${\displaystyle G}$ at ${\displaystyle \beta }$ in ${\displaystyle {\mathcal {S}}}$, then ${\displaystyle {\overline {d}}\in [\not \in ]h(G)}$.

An ${\displaystyle On}$-long sequence ${\displaystyle {\mathcal {S}}}$ of hypotheses is a revision sequence iff for all ${\displaystyle \alpha }$,

• if ${\displaystyle \alpha =\beta +1}$, then ${\displaystyle {\mathcal {S}}_{\alpha }=\delta _{M,{\mathcal {D}}}({\mathcal {S}}_{\beta })}$, and
• if ${\displaystyle \alpha }$ is a limit, then ${\displaystyle {\mathcal {S}}_{\alpha }}$ coheres with ${\displaystyle {\mathcal {S}}}$ at ${\displaystyle \alpha }$.

Just as with the ${\displaystyle \omega }$ sequences, the successor stages of the sequence are generated by the revision operator. At limit stages, however, the only constraint is that the limit hypothesis cohere with what came before. The unstable elements are set according to a limit rule, the details of which are left open by the set of definitions.

Limit rules can be categorized into two classes, constant and non-constant, depending on whether they do different things at different limit stages. A constant limit rule does the same thing to unstable elements at each limit. One particular constant limit rule, the Herzberger rule, excludes all unstable elements from extensions. According to another constant rule, the Gupta rule, unstable elements are included in extensions just in case they were in ${\displaystyle {\mathcal {S}}_{0}}$. Non-constant limit rules vary the treatment of unstable elements at limits.

Two senses of validity can be defined using ${\displaystyle On}$-long sequences. The first, ${\displaystyle S^{*}}$ validity, is defined in terms of stability. A sentence ${\displaystyle A}$ is valid in ${\displaystyle S^{*}}$ in ${\displaystyle M}$ on ${\displaystyle {\mathcal {D}}}$ iff for all ${\displaystyle On}$-long revision sequences ${\displaystyle {S}}$, there is a stage ${\displaystyle \alpha }$ such that ${\displaystyle A}$ is stably true in ${\displaystyle {\mathcal {S}}}$ after stage ${\displaystyle \alpha }$. A sentence ${\displaystyle A}$ is ${\displaystyle S^{*}}$ valid on ${\displaystyle {\mathcal {D}}}$ just in case for all classical ground models ${\displaystyle M}$, ${\displaystyle A}$ is ${\displaystyle S^{*}}$ valid in ${\displaystyle M}$ on ${\displaystyle {\mathcal {D}}}$.

The second sense of validity, ${\displaystyle S^{\#}}$ validity, uses near stability rather than stability. A sentence ${\displaystyle {A}}$ is nearly stably true in a sequence ${\displaystyle {\mathcal {S}}}$ iff there is an ${\displaystyle \alpha }$ such that for all ${\displaystyle \beta \geq \alpha }$, there is a natural number ${\displaystyle n}$ such that for all ${\displaystyle m\geq n}$, ${\displaystyle M+\delta _{M,{\mathcal {D}}}^{m}({\mathcal {S}}_{\beta })\models A.}$ A sentence ${\displaystyle {A}}$ is nearly stably false in a sequence ${\displaystyle {\mathcal {S}}}$ iff there is an ${\displaystyle \alpha }$ such that for all ${\displaystyle \beta \geq \alpha }$, there is a natural number ${\displaystyle n}$ such that for all ${\displaystyle m\geq n}$, ${\displaystyle M+\delta _{M,{\mathcal {D}}}^{m}({\mathcal {S}}_{\beta })\not \models A.}$ A nearly stable sentence may have finitely long periods of instability following limits, after which it settles down until the next limit.

A sentence ${\displaystyle A}$ is valid in ${\displaystyle S^{\#}}$ in ${\displaystyle M}$ on iff for all ${\displaystyle On}$-long revision sequences ${\displaystyle {S}}$, there is a stage ${\displaystyle \alpha }$ such that ${\displaystyle A}$ is nearly stably true in ${\displaystyle {\mathcal {S}}}$ after stage ${\displaystyle \alpha }$. A sentence ${\displaystyle A}$ is valid in ${\displaystyle S^{\#}}$ in on just in case it is valid in ${\displaystyle S^{\#}}$ in all ground models.

If a sentence is valid in ${\displaystyle S^{*}}$, then it is valid in ${\displaystyle S^{\#}}$, but not conversely. An example using ${\displaystyle {\mathcal {D}}_{3}}$ shows this for validity in a model. The sentence ${\displaystyle \forall xJx}$ is not valid in ${\displaystyle \mathbb {N} }$ in ${\displaystyle S_{0}}$, but it is valid in ${\displaystyle S^{\#}}$.

An attraction of ${\displaystyle S^{\#}}$ validity is that it generates a simpler logic than ${\displaystyle S^{*}}$. The proof system ${\displaystyle C_{0}}$ is sound for ${\displaystyle S^{\#}}$, but it is not, in general, complete. In light of the completeness of ${\displaystyle C_{0}}$, if a sentence is valid in ${\displaystyle S_{0}}$, then it is valid in ${\displaystyle S^{\#}}$, but the converse does not hold in general. Validity in ${\displaystyle S_{0}}$ and in ${\displaystyle S^{*}}$ are, in general, incomparable. Consequently, ${\displaystyle C_{0}}$ is not sound for ${\displaystyle S^{*}}$.

Finite definitions

While ${\displaystyle S^{\#}}$ validity outstrips ${\displaystyle S_{0}}$ validity, in general, there is a special case in which the two coincide, finite definitions. Loosely speaking, a definition is finite if all revision sequences stop producing new hypotheses after a finite number of revisions. To put it more precisely, we define a hypothesis ${\displaystyle h}$ as reflexive just in case there is an ${\displaystyle n>0}$ such that ${\displaystyle h=\delta _{M,{\mathcal {D}}}^{n}(h)}$. A definition is finite iff for all models ${\displaystyle M}$, for all hypotheses ${\displaystyle h}$, there is a natural number ${\displaystyle n}$, such that ${\displaystyle \delta _{M,{\mathcal {D}}}^{n}(h)}$ is reflexive. Gupta showed that if ${\displaystyle {\mathcal {D}}}$ is finite, then ${\displaystyle S^{\#}}$ validity and ${\displaystyle S_{0}}$ validity coincide.

There is no known syntactic characterization of the set of finite definitions, and finite definitions are not closed under standard logical operations, such as conjunction and disjunction. Maricarmen Martinez has identified some syntactic features under which the set of finite definitions is closed.^[12] She has shown that if ${\displaystyle {L}}$ contains only unary predicates, apart from identity, contains no function symbols, and the definienda of ${\displaystyle {\mathcal {D}}}$ are all unary, then ${\displaystyle {\mathcal {D}}}$ is finite.

While many standard logical operations do not preserve finiteness, it is preserved by the operation of self-composition.^[13] For a definition ${\displaystyle G{\overline {x}}=_{Df}A({\overline {x}},G)}$, define self-composition recursively as follows.

• ${\displaystyle A^{0}({\overline {x}},G)=G{\overline {x}}}$ and
• ${\displaystyle A^{n+1}({\overline {x}},G)=A^{n}({\overline {x}},G)[A({\overline {t}},G)/G{\overline {t}}]}$.

The latter says that ${\displaystyle A^{n+1}}$ is obtained by replacing all instances of ${\displaystyle G{\overline {t}}}$ in ${\displaystyle A^{n}}$, with ${\displaystyle A({\overline {t}},G)}$. If ${\displaystyle {\mathcal {D}}}$ is a finite definition and ${\displaystyle {\mathcal {D}}^{n}}$ is the result of replacing each definiens ${\displaystyle B}$ in ${\displaystyle {\mathcal {D}}}$ with ${\displaystyle B^{n}}$, then ${\displaystyle {\mathcal {D}}^{n}}$ is a finite definition as well.

Notable formal features

Revision theory distinguishes material equivalence from definitional equivalence.^[14] The sets of definitions use the latter. In general, definitional equivalence is not the same as material equivalence. Given a definition

${\displaystyle Gx=_{Df}A(x,G),}$

its material counterpart,

${\displaystyle \forall x(Gx\equiv A(x,G)),}$

will not, in general, be valid.^[15] The definition

${\displaystyle Gx=_{Df}\sim Gx}$

illustrates the invalidity. Its definiens and definiendum will not have the same truth value after any revision, so the material biconditional will not be valid. For some definitions, the material counterparts of the defining clauses are valid. For example, if the definientia of contain only symbols from the ground language, then the material counterparts will be valid.

The definitions given above are for the classical scheme. The definitions can be adjusted to work with any semantic scheme.^[16] This includes three-valued schemes, such as Strong Kleene, with exclusion negation, whose truth table is the following.

Exclusion negation

${\displaystyle \lnot }$
${\displaystyle {\textbf {t}}}$	${\displaystyle {\textbf {f}}}$
${\displaystyle {\textbf {n}}}$	${\displaystyle {\textbf {f}}}$
${\displaystyle {\textbf {f}}}$	${\displaystyle {\textbf {t}}}$

Notably, many approaches to truth, such as Saul Kripke’s Strong Kleene theory, cannot be used with exclusion negation in the language.

Revision theory, while in some respects similar to the theory of inductive definitions, differs in several ways.^[17] Most importantly, revision need not be monotonic, which is to say that extensions at later stages need not be supersets of extensions at earlier stages, as illustrated by the first example above. Relatedly, revision theory does not postulate any restrictions on the syntactic form of definitions. Inductive definitions require their definientia to be positive, in the sense that definienda can only appear in definientia under an even number of negations. (This assumes that negation, conjunction, disjunction, and the universal quantifier are the primitive logical connectives, and the remaining classical connectives are simply defined symbols.) The definition

${\displaystyle Gx=_{Df}(x{\text{ is even }}\&\ Gx)\vee (x{\text{ is odd }}\&\ \sim Gx)}$

is acceptable in revision theory, although not in the theory of inductive definitions.

Inductive definitions are semantically interpreted via fixed points, hypotheses ${\displaystyle h}$ for which ${\displaystyle h=\delta _{M,{\mathcal {D}}}(h)}$. In general, revision sequences will not reach fixed points. If the definientia of ${\displaystyle {\mathcal {D}}}$ are all positive, then revision sequences will reach fixed points, as long as the initial hypothesis has the feature that ${\displaystyle h(G)\subseteq \delta _{M,{\mathcal {D}}}(h)(G)}$, for each ${\displaystyle G}$. In particular, given such a ${\displaystyle {\mathcal {D}}}$, if the initial hypothesis assigns the empty extension to all definienda, then the revision sequence will reach the minimal fixed point.

The sets of valid sentences on some definitions can be highly complex, in particular ${\displaystyle \Pi _{2}^{1}}$. This was shown by Philip Kremer and Aldo Antonelli.^[18] There is, consequently, no proof system for ${\displaystyle S^{\#}}$ validity.

Truth

The most famous application of revision theory is to the theory of truth, as developed in Gupta and Belnap (1993), for example. The circular definition of truth is the set of all the Tarski biconditionals, ‘${\displaystyle A}$’ is true iff ${\displaystyle A}$, where ‘iff’ is understood as definitional equivalence, ${\displaystyle =_{Df}}$, rather than material equivalence. Each Tarski biconditional provides a partial definition of the concept of truth. The concept of truth is circular because some Tarski biconditionals use an ineliminable instance of ‘is true’ in their definiens. For example, suppose that ${\displaystyle b}$ is the name of a truth-teller sentence, ${\displaystyle b}$ is true. This sentence has as its Tarski biconditional: ${\displaystyle b}$ is true iff ${\displaystyle b}$ is true. The truth predicate on the right cannot be eliminated. This example depends on there being a truth-teller in the language. This and other examples show that truth, defined by the Tarski biconditionals, is a circular concept.

Some languages, such as the language of arithmetic, will have vicious self-reference. The liar and other pathological sentences are guaranteed to be in the language with truth. Other languages with truth can be defined that lack vicious self-reference.^[19] In such a language, any revision sequence ${\displaystyle {S}}$ for truth is bound to reach a stage where ${\displaystyle {S}_{\alpha }={S}_{\alpha +1}}$, so the truth predicate behaves like a non-circular predicate.^[20] The result is that, in such languages, truth has a stable extension that is defined over all sentences of the language. This is in contrast to many other theories of truth, for example the minimal Strong Kleene and minimal supervaluational theories. The extension and anti-extension of the truth predicate in these theories will not exhaust the set of sentences of the language.

The difference between ${\displaystyle S^{\#}}$ and ${\displaystyle S^{*}}$ is important when considering revision theories of truth. Part of the difference comes across in the semantical laws, which are the following equivalences, where T is a truth predicate.^[21]

• ${\displaystyle \forall A(T(\ulcorner \sim A\urcorner )\equiv \sim T(\ulcorner A\urcorner ))}$
• ${\displaystyle \forall A,B(T(\ulcorner {A\&B}\urcorner )\equiv T(\ulcorner {A}\urcorner )\&T(\ulcorner {B}\urcorner ))}$
• Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): \forall A,B(T(\ulcorner {A\lor B}\urcorner )\equiv T(\ulcorner {A}\urcorner )\lor T(\ulcorner {B}\urcorner ))
• ${\displaystyle \forall A(T(\ulcorner \forall xA\urcorner )\equiv \forall tT(\ulcorner A[x/t]\urcorner ))}$

These are all valid in ${\displaystyle S^{\#}}$, although the last is valid only when the domain is countable and every element is named. In ${\displaystyle S^{*}}$, however, none are valid. One can see why the negation law fails by considering the liar, ${\displaystyle a=\ulcorner {\sim Ta}\urcorner }$. The liar and all finite iterations of the truth predicate to it are unstable, so one can set ${\displaystyle T\ulcorner {Ta}\urcorner }$ and ${\displaystyle T\ulcorner {\sim Ta}\urcorner }$ to have the same truth value at some limits, which results in ${\displaystyle \sim T\ulcorner {Ta}\urcorner }$ and ${\displaystyle T\ulcorner {\sim Ta}\urcorner }$ having different truth values. This is corrected after revision, but the negation law will not be stably true. It is a consequence of a theorem of Vann McGee that the revision theory of truth in ${\displaystyle S^{\#}}$ is ${\displaystyle \omega }$-inconsistent.^[22] The ${\displaystyle S^{*}}$ theory is not ${\displaystyle \omega }$-inconsistent.

There is an axiomatic theory of truth that is related to the ${\displaystyle S^{\#}}$ theory in the language of arithmetic with truth. The Friedman-Sheard theory (FS) is obtained by adding to the usual axioms of Peano arithmetic

• the axiom ${\displaystyle \forall s,t(T(\ulcorner {s=t}\urcorner )\equiv s=t)}$,
• the semantical laws,
• the induction axioms with the truth predicate, and
• the two rules
  • if ${\displaystyle \vdash A}$, then ${\displaystyle \vdash T(\ulcorner A\urcorner )}$, and
  • if ${\displaystyle \vdash T(\ulcorner A\urcorner )}$, then ${\displaystyle \vdash A}$.^[23]

By McGee's theorem, this theory is ${\displaystyle \omega }$-inconsistent. FS does not, however, have as theorems any false purely arithmetical sentences.^[24] FS has as a theorem global reflection for Peano arithmetic,

${\displaystyle \forall x((\mathrm {Sent} (x)\ \&\ \mathrm {Bew} _{PA}(x))\supset Tx),}$

where ${\displaystyle \mathrm {Bew} _{PA}}$ is a provability predicate for Peano arithmetic and ${\displaystyle \mathrm {Sent} }$ is a predicate true of all and only sentences of the language with truth. Consequently, it is a theorem of FS that Peano arithmetic is consistent.

FS is a subtheory of the theory of truth for arithmetic, the set of sentences valid in ${\displaystyle S^{\#}}$. A standard way to show that FS is consistent is to use an ${\displaystyle \omega }$-long revision sequence.^[25] There has been some work done on axiomatizing the ${\displaystyle S^{*}}$ theory of truth for arithmetic.^[26]

Other applications

Revision theory has been used to study circular concepts apart from truth and to provide alternative analyses of concepts, such as rationality.

A non-well-founded set theory is a set theory that postulates the existence of a non-well-founded set, which is a set ${\displaystyle x}$ that has an infinite descending chain along the membership relation,

${\displaystyle \cdots x_{n+1}\in x_{n}\in \cdots \in x_{1}\in x.}$

Antonelli has used revision theory to construct models of non-well-founded set theory.^[27] One example is a set theory that postulates a set whose sole member is itself, ${\displaystyle x=\{x\}}$.

Infinite-time Turing machines are models of computation that permit computations to go on for infinitely many steps. They generalize standard Turing machines used in the theory of computability. Benedikt Löwe has shown that there are close connections between computations of infinite-time Turing machines and revision processes.^[28]

Rational choice in game theory has been analyzed as a circular concept. André Chapuis has argued that the reasoning agents use in rational choice exhibits an interdependence characteristic of circular concepts.^[29]

Revision theory can be adapted to model other sorts of phenomena. For example, vagueness has been analyzed in revision-theoretic terms by Conrad Asmus.^[30] To model a vague predicate on this approach, one specifies pairs of similar objects and which objects are non-borderline cases, and so are unrevisable. The borderline objects change their status with respect to a predicate depending on the status of the objects to which they are similar.

Revision theory has been used by Gupta to explicate the logical contribution of experience to one's beliefs.^[31] According to this view, the contribution of experience is represented by a rule of revision that takes as input on an agent's view, or concepts and beliefs, and yields as output perceptual judgments. These judgments can be used to update the agent's view.

See also

• Anil Gupta
• Circular definition
• Definition
• Paradox
• Philosophical logic
• Truth

References

External links

• Kremer, P. (2014) The Revision Theory of Truth. In Zalta, E. N., editor, The Stanford Encyclopedia of Philosophy. Summer 2014 edition.