Resource title

Parallel interpolation, splitting, and relevance in belief change

Resource image

image for OpenScout resource :: Parallel interpolation, splitting, and relevance in belief change

Resource description

The splitting theorem says that any set of formulae has a finest representation as a family of letter-disjoint sets. Parikh formulated this for classical propositional logic, proved it in the finite case, used it to formulate a criterion for relevance in belief change, and showed that AGMpartial meet revision can fail the criterion. In this paper we make three further contributions. We begin by establishing a new version of the well-known interpolation theorem, which we call parallel interpolation, use it to prove the splitting theorem in the infinite case, and show how AGM belief change operations may be modified, if desired, so as to ensure satisfaction of Parikh’s relevance criterion.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://eprints.lse.ac.uk/3401/1/Parallel_interpolation%2C_splitting_and_relevance_%28LSERO%29.pdf

Resource license