Studia Logica 73 (2):167 - 182 (2003)
When a belief set is contracted only some beliefs are eligible for removal. By introducing eligibility for removal as a new semantic primitive for contraction and combining it with epistemic entrenchment we get a contraction operator with a number of interesting properties. By placing some minimal constraint upon eligibility we get an explicit contraction recipe that exactly characterises the so called interpolation thesis, a thesis that states upper and lower bounds for the amount of information to be given up in contraction. As a result we drop the controversial property of recovery. By placing additional constraints on eligibility we get representation theorems for a number of contraction operators of varying strength. In addition it is shown that recovery contraction is a special case that we get if eligibility is explicitly constructed in terms of logical relevance.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Equilibria in Social Belief Removal.Richard Booth & Thomas Meyer - 2010 - Synthese 177 (1):97 - 123.
A General Family of Preferential Belief Removal Operators.Richard Booth, Thomas Meyer & Chattrakul Sombattheera - 2012 - Journal of Philosophical Logic 41 (4):711 - 733.
Similar books and articles
A Survey of Multiple Contractions.André Fuhrmann & Sven Ove Hansson - 1994 - Journal of Logic, Language and Information 3 (1):39-75.
The Concept of Contraction in Giordano Bruno's Philosophy.Leo Catana - 2005 - Ashgate.
Three Approaches to Iterated Belief Contraction.Raghav Ramachandran, Abhaya C. Nayak & Mehmet A. Orgun - 2012 - Journal of Philosophical Logic 41 (1):115-142.
Added to index2009-01-28
Total downloads11 ( #404,874 of 2,172,833 )
Recent downloads (6 months)4 ( #75,736 of 2,172,833 )
How can I increase my downloads?