Abstract
Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.
Similar content being viewed by others
References
Alchourrón Carlos, Peter Gärdenfors, David Makinson: On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. Journal of Symbolic Logic 50, 510–530 (1985)
Alchourrón Carlos, David Makinson: On the logic of theory change: Contraction functions and their associated revision functions. Theoria 48, 14–37 (1982)
Chopra Samir, Rohit Parikh: Relevance sensitive belief structures. Annals of Mathematics and Artificial Intelligence 28, 259–285 (2000)
Hansson, Sven Ove, A Textbook of Belief Dynamics. Theory Change and Database Updating. Kluwer, 1999.
Hansson Sven Ove: Contraction Based on Sentential Selection. Journal of Logic and Computation 17, 479–498 (2007)
Hansson Sven Ove: Specified Meet Contraction. Erkenntnis 69, 31–54 (2008)
Hansson Sven Ove: Global and Iterated Contraction and Revision: An Exploration of Uniform and Semi-Uniform Approaches. Journal of Philosophical Logic 41, 143–172 (2012)
Hansson Sven Ove, Renata Wassermann: Local Change. Studia Logica 70, 49–76 (2002)
Kourousias George, David Makinson: Parallel interpolation, splitting, and relevance in belief change. Journal of Symbolic Logic 72, 994–1002 (2007)
Parikh, Rohit, Beliefs, belief revision, and splitting languages, in L. Moss, J. Ginzburg, and M. de Rijke (eds.), Logic, language, and computation, vol. 2. Stanford, California: CSLI Publications, 1999, pp. 266–278.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hansson, S.O. Finite Contractions on Infinite Belief Sets. Stud Logica 100, 907–920 (2012). https://doi.org/10.1007/s11225-012-9440-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-012-9440-9