Skip to main content

Belief Change

  • Chapter
  • First Online:
Introduction to Formal Philosophy

Part of the book series: Springer Undergraduate Texts in Philosophy ((SUTP))

  • 123k Accesses

Abstract

All formal models of belief change involve choices between different ways to accommodate new information. However, the models differ in their loci of choice, i.e. in what formal entities the choice mechanism is applied to. Four models of belief change with different loci of choice are investigated in terms of how they satisfy a set of important properties of belief contraction and revision. It is concluded that the locus of epistemic choice has a large impact on the properties of the resulting belief change operation.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    See [12] for a proof that Finite-based contraction does not hold. The proof that Finite-based revision does not hold has not been published, and is therefore given here: Let S be an infinite set of logical atoms in the language, let p be another such atom, and let K = Cn({¬p}). Then {¬p ∨ s∣s ∈ S} is a subset of K that does not imply ¬p. It follows from compactness and the axiom of choice that there is some X such that {¬p ∨ s∣s ∈ S} ⊆ X ∈ K⊥¬p [1]. Let γ be a selection function such that γ(K⊥¬p) = {X} and let ∗ be the revision based on γ. Then {¬p ∨ s∣s ∈ S}∪{p} ⊆ K ∗ p, and since K ∗ p is logically closed we have S ⊆ K ∗ p and consequently K ∗ p is not finite-based.

  2. 2.

    AGM is also equivalent to a construction based on selection among the sentences in K, namely epistemic entrenchment [6, 7, 16, 17]. It is also close to equivalent to another such construction, safe contraction [2, 18].

  3. 3.

    Provided that the language has an infinite number of non-equivalent sentences. For a proof, see [12].

  4. 4.

    More precisely: if there is more than one top candidate and the top candidates are all p-remainders for some sentence p, then their intersection is not itself a top candidate.

  5. 5.

    In the limiting case when the outcome set contains no element that satisfies the descriptor, nothing is changed, i.e. the original belief set is the outcome of the operation.

References

  1. Alchourrón, C. E., & Makinson, D. (1981). Hierarchies of regulation and their logic. In R. Hilpinen (Ed.). New studies in deontic logic (pp. 125–148). Dordrecht: D. Reidel Publishing Company.

    Chapter  Google Scholar 

  2. Alchourrón, C. E., & Makinson, D. (1985). On the logic of theory change: Safe contraction. Studia Logica, 44, 405–422

    Article  Google Scholar 

  3. *Alchourrón, C. E., Gärdenfors, P., & Makinson, D. (1985). On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic, 50, 510–530. [The major starting-point of the whole research area.].

    Article  Google Scholar 

  4. *Fermé, E., & Hansson, S. O. (2011). AGM 25 years. Twenty-five years of research in belief change. Journal of Philosophical Logic, 40, 295–331. [A comparatively brief and non-technical overview of the research area.].

    Article  Google Scholar 

  5. *Fermé, E., & Hansson, S. O. (In press). Belief change. Introduction and overview. Springer 2018. [A comparatively non-technical overview of the area.].

    Google Scholar 

  6. *Gärdenfors, P. (1988). Knowledge in flux. Modeling the dynamics of epistemic states. Cambridge: The MIT Press. [A philosophical account of the AGM model by one of its originators.].

    Google Scholar 

  7. Gärdenfors, P., & Makinson, D. (1988). Revisions of knowledge systems using epistemic entrenchment. In M. Y. Vardi (Ed.). Proceedings of the Second Conference on Theoretical Aspects of Reasoning About Knowledge (pp. 83–95). Los Altos: Morgan Kaufmann.

    Google Scholar 

  8. Glaister, S. M. (2000). Recovery recovered. Journal of Philosophical Logic, 29, 171–206.

    Article  Google Scholar 

  9. Grove, A. (1988). Two modellings for theory change. Journal of Philosophical Logic, 17, 157–170.

    Article  Google Scholar 

  10. Hansson, S. O. (1991). Belief contraction without recovery. Studia Logica, 50, 251–260.

    Article  Google Scholar 

  11. *Hansson, S. O. (1999). A textbook of belief dynamics. Theory change and database updating. Dordrecht: Kluwer. [Detailed introduction with a strong focus on AGM and belief base operations. Contains proofs of all the major theorems.].

    Google Scholar 

  12. Hansson, S. O. (2008). Specified meet contraction. Erkenntnis, 69, 31–54.

    Article  Google Scholar 

  13. Hansson, S. O. (2014). Descriptor revision. Studia Logica, 102, 955–980.

    Article  Google Scholar 

  14. *Hansson, S. O. (2017). Descriptor revision. Belief change through direct choice. Cham: Springer. [A full treatment of descriptor revision.].

    Chapter  Google Scholar 

  15. Makinson, D. (1997). On the force of some apparent counterexamples to recovery. In E. G. Valdés, et al. (Eds.). Normative systems in legal and moral theory, Festschrift for Carlos Alchourrón and Eugenio Bulygin (pp. 475–481). Berlin: Duncker and Humblot.

    Google Scholar 

  16. *Rott, H. (2001). Change, choice and inference: A study of belief revision and nonmonotonic reasoning. Oxford: Oxford University Press. [An exposition of AGM theory with a strong emphasis on its connections with the study of rational choice.].

    Google Scholar 

  17. Rott, H. (2003). Basic entrenchment. Studia Logica, 73, 257–280.

    Article  Google Scholar 

  18. Rott, H., & Hansson, S. O. (2014). Safe contraction revisited. In S. O. Hansson (Ed.). David Makinson on classical methods for non-classical problems (pp. 35–70). Dordrecht: Springer.

    Chapter  Google Scholar 

  19. Sandqvist, T. (2000). On why the best should always meet. Economics and Philosophy, 16, 287–313.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sven Ove Hansson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hansson, S.O. (2018). Belief Change. In: Hansson, S., Hendricks, V. (eds) Introduction to Formal Philosophy. Springer Undergraduate Texts in Philosophy. Springer, Cham. https://doi.org/10.1007/978-3-319-77434-3_20

Download citation

Publish with us

Policies and ethics