A Non-Minimal but Very Weak Axiomatization of Common Belief
Philippe Mongin
Abstract
Philippe Mongin
Abstract
The paper introduces a modal logic system of individual and common belief which is shown to be sound and complete with respect to a version of Neighbourhood semantics. This axiomatization of common belief is the weakest of all those currently available : it dispenses with even the Monotonicity rule of individual belief. It is non-minimal in that it does not use just the Equivalence rule but the conjunction of the latter with the specially devised rule of C-Restricted Monotonicity
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper introduces a modal logic system of individual and common belief which is shown to be sound and complete with respect to a version of Neighbourhood semantics. This axiomatization of common belief is the weakest of all those currently available : it dispenses with even the Monotonicity rule of individual belief. It is non-minimal in that it does not use just the Equivalence rule but the conjunction of the latter with the specially devised rule of C-Restricted Monotonicity
Key concepts: Monotonic function, Belief revision, Equivalence (formal languages), Modal operator, Modal, Mathematics, Non-monotonic logic, Modal logic