David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
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)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
Richard Booth & Thomas Meyer (2010). Equilibria in Social Belief Removal. Synthese 177 (1):97 - 123.
Richard Booth, Thomas Meyer & Chattrakul Sombattheera (2012). A General Family of Preferential Belief Removal Operators. Journal of Philosophical Logic 41 (4):711 - 733.
Similar books and articles
SvenOve Hansson (2000). Coherentist Contraction. Journal of Philosophical Logic 29 (3):315-330.
Sven Ove Hansson (1994). Kernel Contraction. Journal of Symbolic Logic 59 (3):845-859.
Andreja Prijatelj (1995). Connectification Forn-Contraction. Studia Logica 54 (2):149 - 171.
Sven Ove Hansson (2008). Specified Meet Contraction. Erkenntnis 69 (1):31 - 54.
Sven Ove Hansson (2010). Multiple and Iterated Contraction Reduced to Single-Step Single-Sentence Contraction. Synthese 173 (2):153 - 177.
André Fuhrmann & Sven Ove Hansson (1994). A Survey of Multiple Contractions. Journal of Logic, Language and Information 3 (1):39-75.
Raghav Ramachandran, Abhaya C. Nayak & Mehmet A. Orgun (2012). Three Approaches to Iterated Belief Contraction. Journal of Philosophical Logic 41 (1):115-142.
Jun Li (1998). A Note on Partial Meet Package Contraction. Journal of Logic, Language and Information 7 (2):139-142.
Added to index2009-01-28
Total downloads11 ( #308,441 of 1,902,212 )
Recent downloads (6 months)6 ( #135,281 of 1,902,212 )
How can I increase my downloads?