Impossibility results for belief contraction
Three seemingly weak and plausible conditions on an operation of contraction on belief sets are shown to be logically incompatible: (1) there is at least one sentence that can be successfully removed by the operation, (2) both the original belief set and the outcome of the operation have finite representations, and (3) a non-tautologous sentence can be removed without loss of all its non-tautologous logical consequences.
KeywordsBelief change Contraction Eradication Success postulates Finite-based outcome
Mathematics Subject Classification (2010)03B42
- 3.Fermé, E., Hansson, S.O.: Shielded contraction. In: Rott, H., Williams, M.-A. (eds.) Frontiers of Belief Revision, pp 85–107 . Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
- 5.Gärdenfors, P., Makinson, D.: Revisions of knowledge systems using epistemic entrenchment. In: Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, pp 83–95. Morgan Kaufmann Publishers, Los Angeles (1988)Google Scholar
- 8.Hansson, S.O.: In praise of full meet contraction. Análisis Filosófico 26, 134–146 (2006)Google Scholar
- 15.Parikh, R.: Beliefs, belief revision, and splitting languages, pp. 266-278 in Lawrence S. Moss, Jonathan Ginzburg, and Maarten de Rijke (eds) Logic, language, and computation, vol 2, CSLI lecture notes 96. Stanford, CA: CSLI (1999)Google Scholar
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.