The Complexity of Revision

Abstract

In this paper we show that the Gupta-Belnap systems S# and S∗ are 2. Since Kremer has independently established that they are 2-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.

DOI: 10.1305/ndjfl/1040609294

Extracted Key Phrases

Cite this paper

@article{Antonelli1994TheCO, title={The Complexity of Revision}, author={Gian Aldo Antonelli}, journal={Notre Dame Journal of Formal Logic}, year={1994}, volume={35}, pages={67-72} }