Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 35, Number 1 (1994), 67-72.
The Complexity of Revision
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.
Notre Dame J. Formal Logic Volume 35, Number 1 (1994), 67-72.
First available in Project Euclid: 22 December 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03B60: Other nonclassical logic
Antonelli, Gian Aldo. The Complexity of Revision. Notre Dame J. Formal Logic 35 (1994), no. 1, 67--72. doi:10.1305/ndjfl/1040609294. https://projecteuclid.org/euclid.ndjfl/1040609294