On Definability in Multimodal Logic II. Defining Knowledge in Terms of Belief∗
نویسندگان
چکیده
The question of whether knowledge is definable in terms of belief, which has played an important role in epistemology for the last fifty years, is studied here in the framework of epistemic and doxastic logics. Three notions of definability are considered: explicit definability, implicit definability, and reducibility, where explicit definability is equivalent to the combination of implicit definability and reducibility. It is shown that if knowledge satisfies any set of axioms contained in S5, then it cannot be explicitly defined in terms of belief. S5 knowledge can be implicitly defined by belief, but not reduced to it. On the other hand, S4.4 knowledge and weaker notions of knowledge cannot be implicitly defined by belief, but can be reduced to it by defining knowledge as true belief. It is also shown that S5 knowledge cannot be reduced to belief and justification, provided that there are no axioms that involve both belief and justification. ∗We thank Samson Abramsky, Arnon Avron, Johan van Benthem, Sergiu Hart, Martin Meier, and Jouku Väänänen for helpful discussions. †Supported in part by NSF under grants TR-0325453 and IIS-0534064, by FOSR under grant FA9550-05-1-0055. ‡Support by the Israeli Science Foundation under grant 891/04 is acknowledged.
منابع مشابه
Defining Knowledge in Terms of Belief: the Modal Logic Perspective
The question of whether knowledge is definable in terms of belief, which has played an important role in epistemology for the last fifty years, is studied here in the framework of epistemic and doxastic logics. Three notions of definability are considered: explicit definability, implicit definability, and reducibility, where explicit definability is equivalent to the combination of implicit def...
متن کاملProbability Logic for Harsanyi Type Spaces
Probability logic has contributed to significant developments in belief types for game-theoretical economics. We present a new probability logic for Harsanyi Type spaces, show its completeness, and prove both a denesting property and a unique extension theorem. We then prove that multi-agent interactive epistemology has greater complexity than its single-agent counterpart by showing that if the...
متن کاملOn Definability in Multimodal Logic
Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, r...
متن کاملParametric Constructive Kripke-Semantics for Standard Multi-Agent Belief and Knowledge (Knowledge As Unbiased Belief)
We propose parametric constructive Kripke-semantics for multi-agent KD45-belief and S5-knowledge in terms of elementary set-theoretic constructions of two basic functional building blocks, namely bias (or viewpoint) and visibility, functioning also as the parameters of the doxastic and epistemic accessibility relation. The doxastic accessibility relates two possible worlds whenever the applicat...
متن کاملA Multimodal Logic Approach to Order of Magnitude Qualitative Reasoning with Comparability and Negligibility Relations
Non-classical logics have proven to be an adequate framework to formalize knowledge representation. In this paper we focus on a multimodal approach to formalize order-of-magnitude qualitative reasoning, extending the recently introduced system MQ, by means of a certain notion of negligibility relation which satisfies a number of intuitively plausible properties, as well as a minimal axiom syste...
متن کامل