The Complexity of Revision, Revised

G. Aldo Antonelli · Notre Dame Journal of Formal Logic · 2002

The purpose of this note is to acknowledge a gap in a previous paper, "The complexity of revision," and to provide a corrected version of the argument.The main point of the argument given in Antonelli [1] is to show that the Gupta-Belnap revision-theoretic system S * admits of an analogue of the Löwenheim-Skolem theorem for first-order logic (all notation and terminology are defined in Gupta and Belnap [2]).In particular, a crucial step in the argument requires that we show the following.

Read the paper · More papers on PaperTik