Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T08:09:52.278Z Has data issue: false hasContentIssue false

Parallel interpolation, splitting, and relevance in belief change

Published online by Cambridge University Press:  12 March 2014

George Kourousias
Affiliation:
Department of Computer Science, Group of Logic & Computation, King's College London, Strand London WC2R 2LS, UK, E-mail: george.kourousias@googlemail.com
David Makinson
Affiliation:
Department of Philosophy, Logic & Scientific Method, London School of Economics, Houghton Street, London WC2A 2AE, UK, E-mail: david.makinson@googlemail.com

Abstract

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 AGM partial 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable