The question of whether knowledge is definable in terms of belief, which has played an important role in epistemology for the last 50 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. (shrink)

We show that knowledge satisfies interpersonal independence, meaning that a non-trivial sentence describing one agent’s knowledge cannot be equivalent to a sentence describing another agent’s knowledge. The same property of interpersonal independence holds, mutatis mutandis, for belief. In the case of knowledge, interpersonal independence is implied by the fact that there are no non-trivial sentences that are common knowledge in every model of knowledge. In the case of belief, interpersonal independence follows from a strong interpersonal independence that knowledge does not (...) have. Specifically, there is no sentence describing the beliefs of one person that implies a sentence describing the beliefs of another person. (shrink)

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, reducibility, is introduced; it is shown that in multimodal logics, explicit definability is equivalent to the combination of implicit definability and reducibility. (...) The three notions of definability are characterized semantically using (modal) algebras. The use of algebras, rather than frames, is shown to be necessary for these characterizations. (shrink)

The literary source of the main ideas in Aumann's article "Backward Induction and Common Knowledge of Rationality" is exposed and analyzed. The primordial archetypal images that underlie both this literary source and Aumann's work are delineated and are used to explain the great emotive impact that this work had on the community of game theorists.

We propose a model of an agent’s probability and utility that is a compromise between Savage (The foundations of statistics, Wiley, 1954) and Jeffrey (The Logic of Decision, McGraw Hill, 1965). In Savage’s model the probability–utility pair is associated with preferences over acts which are assignments of consequences to states. The probability is defined on the state space, and the utility function on consequences. Jeffrey’s model has no consequences, and both probability and utility are defined on the same set of (...) propositions. The probability–utility pair is associated with a desirability relation on propositions. Like Savage we assume a set of consequences and a state space. However, we assume that states are comprehensive, that is, each state describes a consequence, as in Aumann (Econometrica 55:1–18, 1987). Like Jeffrey, we assume that the agent has a preference relation, which we call desirability, over events, which by definition involves uncertainty about consequences. For a given probability and utility of consequences, the desirability relation is presented by conditional expected utility, given an event. We axiomatically characterize desirability relations that are represented by a probability–utility pair. We characterize the family of all the probability–utility pairs that represent a given desirability relation. (shrink)

We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.

We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.