The aim of this paper is to introduce a system of dynamic deontic logic in which the main problems related to the de finition of deontic concepts, especially those emerging from a standard analysis of permission in terms of possibility of doing an action without incurring in a violation of the law, are solved. The basic idea is to introduce two crucial distinctions allowing us to differentiate (i) what is ideal with respect to a given code, which fixes the types (...) of action that are abstractly prescribed, and what is ideal with respect to the specific situation in which the agent acts, and (ii) the transitions associated with actions and the results of actions, which can obtain even without the action being performed. (shrink)

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic (...) logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject. (shrink)

The aim of the paper is to point out the modelling choices that lead to different systems of deontic action logic. A kind of a roadmap is presented. On the one hand it can help the reader to find the deontic logic appropriate for an intended application relying on the information considering the way in which a deontic logic represents actions and how it characterises deontic properties in relation to (the representation of) actions. On the other hand it is a (...) guideline how to build a deontic action logic which satisfies the desired properties. (shrink)

The paper tackles two problems. The first one is to grasp the real meaning of Jerzy Kalinowski’s theory of normative sentences. His formal system K 1 is a simple logic formulated in a very limited language . While presenting it Kalinowski formulated a few interesting philosophical remarks on norms and actions. He did not, however, possess the tools to formalise them fully. We propose a formulation of Kalinowski’s ideas with the use of a set-theoretical frame similar to the one presented (...) by Krister Segerberg in his A Deontic Logic of Action. At the same time we enrich the language used by Kalinowski with more operators on actions and present an adequate axiomatisation of the resulting system. That allows us to disclose some unrevealed aspects of Kalinowski’s theory. The most important one is a relation between acts which we call moral indiscernibility. Our second problem is a proper understanding of moral indiscernibility. We show how a repertoire of agent’s actions, defined with the use of simple observable elements of actions, can be filtrated by the relation of moral indiscernibility. That allows us to understand the consequences of Kalinowski’s claim that not doing something good is always bad. (shrink)

Deontic logic is devoted to the study of logical properties of normative predicates such as permission, obligation and prohibition. Since it is usual to apply these predicates to actions, many deontic logicians have proposed formalisms where actions and action combinators are present. Some standard action combinators are action conjunction, choice between actions and not doing a given action. These combinators resemble boolean operators, and therefore the theory of boolean algebra offers a well-known athematical framework to study the properties of the (...) classic deontic operators when applied to actions. In his seminal work, Segerberg uses constructions coming from boolean algebras to formalize the usual deontic notions. Segerberg’s work provided the initial step to understand logical properties of deontic operators when they are applied to actions. In the last years, other authors have proposed related logics. In this chapter we introduce Segerberg’s work, study related formalisms and investigate further challenges in this area. (shrink)

In the paper we present a formal system motivated by a specific methodology of creating norms. According to the methodology, a norm-giver before establishing a set of norms should create a picture of the agent by creating his repertoire of actions. Then, knowing what the agent can do in particular situations, the norm-giver regulates these actions by assigning deontic qualifications to each of them. The set of norms created for each situation should respect (1) generally valid deontic principles being the (...) theses of our logic and (2) facts from the ontology of action whose relevance for the systems of norms we postulate. (shrink)

The semantics for a deontic action logic based on Boolean algebra is extended with an interpretation of action expressions in terms of sets of alternative actions, intended as a way to model choice. This results in a non-classical interpretation of action expressions, while sentences not in the scope of deontic operators are kept classical. A deontic structure based on Simons’ supercover semantics is used to interpret permission and obligation. It is argued that these constructions provide ways to handle various problems (...) related to free choice permission. The main result is a sound and complete axiomatization of the semantics. (shrink)

The paper offers a logical characterisation of multi-step actions in the context of deontic notions of obligation, permission and prohibition. Deontic notions for sequentially composed actions are founded on deontic notions for one-step actions. The present work includes a formal study of situations where execution of a multi-step action has been unsuccessful and provides normative analysis of such actions.

We introduce a family of tableau calculi for deontic action logics based on finite boolean algebras, these logics provide deontic operators which are applied to a finite number of actions ; furthermore, in these formalisms, actions can be combined by means of boolean operators, this provides an expressive algebra of actions. We define a tableau calculus for the basic logic and then we extend this calculus to cope with extant variations of this formalism; we prove the soundness and completeness of (...) these proof systems. In addition, we investigate the computational complexity of the satisfiability problem for DAL and its extensions; we show this problem is NP-complete when the number of actions considered is fixed, and it is \-Hard when the number of actions is taken as an extra parameter. The tableau systems introduced here can be implemented in PSPACE, this seems reasonable taking into consideration the computational complexity of the logics. (shrink)

Belief revision from the point of view of doxastic logic. Logic Journal of the IGPL, 3(4), 535–553. Segerberg, K. (1995). Conditional action. In G. Crocco, L. Fariñas, & A. Herzig (Eds.), Conditionals: From philosophy to computer science, Studies ...