## Notre Dame Journal of Formal Logic

### The Complexity of Revision

Gian Aldo Antonelli

#### Abstract

In this paper we show that the Gupta-Belnap systems and are . Since Kremer has independently established that they are -hard, this completely settles the problem of their complexity. The above-mentioned upper bound is established through a reduction to countable revision sequences that is inspired by, and makes use of a construction of McGee.

#### Article information

Source
Notre Dame J. Formal Logic Volume 35, Number 1 (1994), 67-72.

Dates
First available in Project Euclid: 22 December 2002

Permanent link to this document
http://projecteuclid.org/euclid.ndjfl/1040609294

Mathematical Reviews number (MathSciNet)
MR1271698

Digital Object Identifier
doi:10.1305/ndjfl/1040609294

Zentralblatt MATH identifier
0801.03021

Subjects
Primary: 03B60: Other nonclassical logic

#### Citation

Antonelli, Gian Aldo. The Complexity of Revision. Notre Dame J. Formal Logic 35 (1994), no. 1, 67--72. doi:10.1305/ndjfl/1040609294. http://projecteuclid.org/euclid.ndjfl/1040609294.

#### References

• [1]Kremer, P., The Gupta-Belnap systems $\bf S^\#$ and $\bf S^*$ are not Axiomatisable," The Notre Dame Journal of Formal Logic, vol. 34 (1993), pp. 583--596.
• [2]Belnap, N., and A. Gupta, The Revision Theory of Truth, Mit Press, Cambridge, Ma, 1993.
• [3]Hinman, P., Recursion-Theoretic Hierarchies, Springer-Verlag, Berlin, 1978.
• [4]McGee, V., Truth, Vagueness, and Paradox: An Essay on the Logic of Truth, Hackett, Indianapolis, 1991.