Skip to main content
Log in

Descriptor Revision

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

A descriptor is a set of sentences that are truth-functional combinations of expressions of the form \({\mathfrak{B}p}\) , where \({\mathfrak{B}}\) is a metalinguistic belief predicate and p a sentence in the object language in which beliefs are expressed. Descriptor revision (denoted \({\circ}\)) is an operation of belief change that takes us from a belief set K to a new belief set \({K \circ \Psi}\) where \({\Psi}\) is a descriptor representing the success condition. Previously studied operations of belief change are special cases of descriptor revision, hence sentential revision can be represented as \({\Psi = \{\mathfrak{B}p\}}\) , contraction as \({\Psi = \{\neg \mathfrak{B}p\}}\) , multiple contraction as \({\Psi = \{\neg\mathfrak{B}p_1, \neg\mathfrak{B}p_2, \ldots, \neg\mathfrak{B}p_n\}}\) , replacement as \({\Psi = \{\mathfrak{B}p, \neg\mathfrak{B}q\}}\) , etc. General models of descriptor revision are constructed and axiomatically characterized. The common selection mechanisms of AGM style belief change cannot be used, but they can be replaced by choice functions operating directly on the set of potential outcomes (available belief sets). The restrictions of this construction to sentential revision (\({\Psi = \{\mathfrak{B}p\} }\)) and sentential contraction give rise to operations with plausible properties that are also studied in some some detail.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alchourrón C., Gärdenfors P., Makinson D.: On the logic of theory change: partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  Google Scholar 

  2. Fermé, E., and S. O. Hansson, Shielded Contraction, in H. Rott and M.-A. Williams (eds.), Frontiers of Belief Revision, Kluwer, Dordrecht, 2001, pp. 85–107.

  3. Fuhrmann A.: Theory contraction through base contraction. Journal of Philosophical Logic 20, 175–203 (1991)

    Article  Google Scholar 

  4. Gärdenfors, P., Knowledge in Flux. Modeling the Dynamics of Epistemic States, The MIT Press, Cambridge, MA, 1988.

  5. Hansson, S. O., Taking belief bases seriously, in D. Prawitz and D. Westerståhl (eds.), Logic and Philosophy of Science in Uppsala, Kluwer, Dordrecht, 1994, pp. 13–28.

  6. Hansson, S. O., A Textbook of Belief Dynamics. Theory Change and Database Updating, Kluwer, Dordrecht, 1999.

  7. Hansson S.O.: Replacement—a Sheffer stroke for belief revision. Journal of Philosophical Logic 38, 127–149 (2009)

    Article  Google Scholar 

  8. Hansson S.O.: Outcome level analysis of belief contraction. Review of Symbolic Logic 6, 183–204 (2013)

    Article  Google Scholar 

  9. Hansson, S. O., Maximal and perimaximal contraction, Synthese, in press, 2013.

  10. Hansson S.O., Fermé E., Cantwell J., Falappa M.: Credibility-limited revision. Journal of Symbolic Logic 66, 1581–1596 (2001)

    Article  Google Scholar 

  11. Levi I.: Subjunctives, dispositions and chances. Synthese 34, 423–455 (1977)

    Article  Google Scholar 

  12. Levi, I., The Enterprise of Knowledge, The MIT Press, Cambridge, MA, 1980.

  13. Levi, I., The Fixation of Belief and Its Undoing, Cambridge University Press, Cambridge, MA, 1991.

  14. Olsson E.J.: A coherence interpretation of semi-revision. Theoria 63, 106–134 (1997)

    Google Scholar 

  15. Rott H.: Preferential belief change using generalized epistemic entrenchment. Journal of Logic, Language and Information 1, 45–78 (1992)

    Article  Google Scholar 

  16. Rott, H., Change, Choice and Inference: A Study of Belief Revision and Nonmonotonic Reasoning, Clarendon Press, Oxford, 2001.

  17. Spohn, W., AGM, ranking theory, and the many ways to cope with examples, in S. O. Hansson (ed.), David Makinson on Classical Methods for Non-Classical Problems, Springer, forthcoming, 2013.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sven Ove Hansson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansson, S.O. Descriptor Revision. Stud Logica 102, 955–980 (2014). https://doi.org/10.1007/s11225-013-9512-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-013-9512-5

Keywords

Navigation