Elementary iterated revision and the Levi Identity

Chandler, Jake and Booth, Richard ORCID: https://orcid.org/0000-0002-6647-6381 2019. Elementary iterated revision and the Levi Identity. Presented at: International Conference on Logic, Rationality and Interaction (LORI), Chongqing, China, October 18-21, 2019. Lecture Notes in Computer Science. -.

Preview

PDF - Accepted Post-Print Version Download (289kB) | Preview

Abstract

Recent work has considered the problem of extending to the case of iterated belief change the so-called ‘Harper Identity’ (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators–natural, restrained and lexicographic, for which we provide here the first collective characterisation in the literature, under the appellation of ‘elementary’ operators. We consider two prima facie plausible ways of extending (LI). The first proposal involves the use of the rational closure operator to offer a ‘reductive’ account of iterated revision in terms of iterated contraction. The second, which doesn’t commit to reductionism, was put forward some years ago by Nayak et al. We establish that, for elementary revision operators and under mild assumptions regarding contraction, Nayak’s proposal is equivalent to a new set of postulates formalising the claim that contraction by not-A should be considered to be a kind of ‘mild’ revision by A. We then show that these, in turn, under slightly weaker assumptions, jointly amount to the conjunction of a pair of constraints on the extension of (HI) that were recently proposed in the literature. Finally, we consider the consequences of endorsing both suggestions and show that this would yield an identification of rational revision with natural revision. We close the paper by discussing the general prospects for defi ing iterated revision in terms of iterated contraction.

Item Type:	Conference or Workshop Item (Paper)
Status:	In Press
Schools:	Computer Science & Informatics
Subjects:	B Philosophy. Psychology. Religion > BC Logic Q Science > QA Mathematics > QA75 Electronic computers. Computer science
ISSN:	0302-9743
Date of First Compliant Deposit:	8 July 2019
Date of Acceptance:	25 June 2019
Last Modified:	26 Oct 2022 07:07
URI:	https://orca.cardiff.ac.uk/id/eprint/124074

Citation Data

Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item