Eligible contraction
Studia Logica 73 (2):167 - 182 (2003)
| Abstract | 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 | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesSvenOve 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).
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.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
