Online research in philosophy

The notion of preference occurs across many areas, including the philosophy of action, decision theory, optimality theory, and game theory. In these settings, individual preferences between worlds or actions can be used to predict behavior by rational agents. In a more abstract sense, the notion of preference also occurs in conditional logic, non-monotonic logic and belief revision theory, whose semantics involve an ordering of the possible worlds in terms of relative similarity or plausibility, or other preference-like relations.

In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by Boolos (...) (in Harv Rev Philos 6:62–65, 1996). In particular, we formalize HLPE and verify a classic solution to it. Moreover, we propose a spectrum of new puzzles based on HLPE by considering subjective (knowledge-based) agent types and relaxing the implicit epistemic assumptions in the original puzzle. The new puzzles are harder than the previously proposed ones in the literature, in the sense that they require deeper epistemic reasoning. Surprisingly, we also show that a version of HLPE in which the agents do not know the others’ types does not have a solution at all. Our formalism paves the way for studying these new puzzles using automatic model checking techniques. (shrink)

Imperatives occur ubiquitously in natural languages. They produce forces which change the addressee’s cognitive state and regulate her actions accordingly. In real life we often receive conflicting orders, typically, issued by various authorities with different ranks. A new update semantics is proposed in this paper to formalize this idea. The general properties of this semantics, as well as its background ideas are discussed extensively. In addition, we compare our framework with other approaches of deontic logics in the context of normative (...) conflicts. (shrink)

SOCREAL 2010: 2nd International Workshop on Philosophy and Ethics of Social Reality. Sapporo, Japan, 2010-03-27/28. Keynote Lecture 2.

Preference is a key area where analytic philosophy meets philosophical logic. I start with two related issues: reasons for preference, and changes in preference, first mentioned in von Wright’s book The Logic of Preference but not thoroughly explored there. I show how these two issues can be handled together in one dynamic logical framework, working with structured two-level models, and I investigate the resulting dynamics of reason-based preference in some detail. Next, I study the foundational issue of entanglement between preference (...) and beliefs, and relate the resulting richer logics to belief revision theory and decision theory. (shrink)

Diversity of agents occurs naturally in epistemic logic, and dynamic logics of information update and belief revision. In this paper we provide a systematic discussion of different sources of diversity, such as introspection ability, powers of observation, memory capacity, and revision policies, and we show how these can be encoded in dynamic epistemic logics allowing for individual variation among agents. Next, we explore the interaction of diverse agents by looking at some concrete scenarios of communication and learning, and we propose (...) a logical methodology to deal with these as well. We conclude with some further questions on the logic of diversity and interaction. (shrink)

We make a proposal for formalizing simultaneous games at the abstraction level of player's powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of 'concurrent game logic' CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.