Generalizing Deontic Action Logic

We introduce a multimodal framework of deontic action logic which encodes the interaction between two fundamental procedures in normative reasoning: conceptual classification and deontic classification. The expressive power of the framework is noteworthy, since it combines insights from agency logic and dynamic logic, allowing for a representation of many kinds of normative conflicts. We provide a semantic characterization for three axiomatic systems of increasing strength, showing how our approach can be modularly extended in order to get different levels of analysis of normative reasoning. Finally, we discuss ways in which the framework can be used to capture other formalisms proposed in the literature, as well as to model searching problems in Artificial Intelligence.

     

Action negation and alternative reductions for dynamic deontic logics

Dynamic deontic logics reduce normative assertions about explicit complex actions to standard dynamic logic assertions about the relation between complex actions and violation conditions. We address two general, but related problems in this field. The first is to find a formalization of the notion of ‘action negation’ that (1) has an intuitive interpretation as an action forming combinator and (2) does not impose restrictions on the use of other relevant action combinators such as sequence and iteration, and (3) has a meaningful interpretation in the normative context. The second problem we address concerns the reduction from deontic assertions to dynamic logic assertions. Our first point is that we want this reduction to obey the free-choice semantics for norms. For ought-to-be deontic logics it is generally accepted that the free-choice semantics is counter-intuitive. But for dynamic deontic logics we actually consider it a viable, if not, the better alternative. Our second concern with the reduction is that we want it to be more liberal than the ones that were proposed before in the literature. For instance, Meyer's reduction does not leave room for action whose normative status is neither permitted nor forbidden. We test the logics we define in this paper against a set of minimal logic requirements.     

Expressivity results for deontic logics of collective agency

We use a deontic logic of collective agency to study reducibility questions about collective agency and collective obligations. The logic that is at the basis of our study is a multi-modal logic in the tradition of stit (‘sees to it that’) logics of agency. Our full formal language has constants for collective and individual deontic admissibility, modalities for collective and individual agency, and modalities for collective and individual obligations. We classify its twenty-seven sublanguages in terms of their expressive power. This classification enables us to investigate reducibility relations between collective deontic admissibility, collective agency, and collective obligations, on the one hand, and individual deontic admissibility, individual agency, and individual obligations, on the other.

     

The paradoxes of permission an action based solution

The aim of this article is to construct a deontic logic in which the free choice postulate allow (Ross, 1941) [11] would be consistent and all the implausible result mentioned in (Hanson, in press) [5] will be blocked. To achieve this we first developed a new theory of action. Then we build a new deontic logic in which the deontic action operator and the deontic proposition operator are explicitly distinguished.     

Logical dynamics of some speech acts that affect obligations and preferences

In this paper, illocutionary acts of commanding will be differentiated from perlocutionary acts that affect preferences of addressees in a new dynamic logic which combines the preference upgrade introduced in DEUL (dynamic epistemic upgrade logic) by van Benthem and Liu with the deontic update introduced in ECL II (eliminative command logic II) by Yamada. The resulting logic will incorporate J. L. Austin’s distinction between illocutionary acts as acts having mere conventional effects and perlocutionary acts as acts having real effects upon attitudes and actions of agents, and help us understand why saying so can make it so in explicit performative utterances. We will also discuss how acts of commanding give rise to so-called “deontic dilemmas” and how we can accommodate most deontic dilemmas without triggering so-called “deontic explosion”.     

From Oughts to Goals: A Logic for Enkrasia

This paper focuses on (an interpretation of) the Enkratic principle of rationality, according to which rationality requires that if an agent sincerely and with conviction believes she ought to X, then X-ing is a goal in her plan. We analyze the logical structure of Enkrasia and its implications for deontic logic. To do so, we elaborate on the distinction between basic and derived oughts, and provide a multi-modal neighborhood logic with three characteristic operators: a non-normal operator for basic oughts, a non-normal operator for goals in plans, and a normal operator for derived oughts. We prove two completeness theorems for the resulting logic, and provide a dynamic extension of the logic by means of product updates. We illustrate how this setting informs deontic logic by considering issues related to the filtering of inconsistent oughts, the restricted validity of deontic closure, and the stability of oughts and goals under dynamics.

     

Leibniz and the Square: A Deontic Logic for the Vir Bonus

Seventeenth century philosopher Gottfried Leibniz's contributions to metaphysics, mathematics, and logic are well known. Lesser known is his ‘invention’ of deontic logic, and that his invention derives from the alethic logic of the Aristotelian square of opposition. In this paper, I show how Leibniz developed this ‘logic of duties’, which designates actions as ‘possible, necessary, impossible, and omissible’ for a ‘vir bonus’ (good person). I show that for Leibniz, deontic logic can determine whether a given action, e.g. as permitted, is therefore obligatory or prohibited (impossible). Secondly, since the deontic modes are derived from what is possible, necessary, etc., for a good person to do, and that ‘right and obligation’ are the ‘moral qualities’ of a good person, we can see how Leibniz derives deontic logic from these moral qualities. Finally, I show how Leibniz grounds a central deontic concept, namely obligation, in the human capacity for freedom.     

What is <Emphasis Type="Italic">the</Emphasis> Logic of Inference?

The topic of this paper is the question whether there is a logic which could be justly called the logic of inference. It may seem that at least since Prawitz, Dummett and others demonstrated the proof-theoretical prominency of intuitionistic logic, the forthcoming answer is that it is this logic that is the obvious choice for the accolade. Though there is little doubt that this choice is correct (provided that inference is construed as inherently single-conclusion and complying with the Gentzenian structural rules), I do not think that the usual justification of it is satisfactory. Therefore, I will first try to clarify what exactly is meant by the question, and then sketch a conceptual framework in which it can be reasonably handled. I will introduce the concept of ‘inferentially native’ logical operators (those which explicate inferential properties) and I will show that the axiomatization of these operators leads to the axiomatic system of intuitionistic logic. Finally, I will discuss what modifications of this answer enter the picture when more general notions of inference are considered. Presented by Hannes Leitgeb     

Squares in Fork Arrow Logic

In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational axiomatization. A proper FA is an algebra of relations where the fork is induced by an injective operation coding pair formation. In contrast to RAs, FAs are representable by proper ones and their equational theory has the expressive power of full first-order logic. A square semantics (the set of arrows is U×U for some set U) for arrow logic was defined by Y. Venema. Due to the negative results about the finite axiomatizability of representable RAs, Venema provided a non-orthodox finite axiomatization for arrow logic by adding a new rule governing the applications of a difference operator. We address here the question of extending the type of relational structures to define orthodox axiomatizations for the class of squares. Given the connections between this problem and the finitization problem addressed by I. Németi, we suspect that this cannot be done by using only logical operations. The modal version of the FA equations provides an orthodox axiomatization for FAL which is complete in view of the representability of FAs. Here we review this result and carry it further to prove that this orthodox axiomatization for FAL also axiomatizes the class of fork squares.     

A decidable multi-modal logic of context

We give a logic for formulas φ−ψ, with the informal reading “ψ is true in the context described by φ”. These are interpreted as binary modalities, by quantification over an enumerable set of unary modalities c−ψ, meaning “ψ is true in context c”. The logic allows arbitrary nesting of contexts.A corresponding axiomatic presentation is given, and proven to be decidable, sound, and complete.Previously, quantificational logic of context restricted the nesting of contexts, and was only known to be decidable in very special cases.     

Notes on Mally’s deontic logic and the collapse of {\varvec{Seinsollen}} and {\varvec{Sein}}

This paper analyzes Mally’s system of deontic logic, introduced in his The Basic Laws of Ought: Elements of the Logic of Willing (1926). We discuss Mally’s text against the background of some contributions in the literature which show that Mally’s axiomatic system for deontic logic is flawed, in so far as it derives, for an arbitrary A, the theorem “A ought to be the case if and only if A is the case”, which represents a collapse of obligation. We then try to sort out and understand which axioms are responsible for the collapse and consider two ways of amending Mally’s system: (i) by changing its original underlying logical basis, that is classical logic, and (ii) by modifying Mally’s axioms.     

Blueprint for a dynamic deontic logic

Extending the idiom of dynamic logic we outline a deontic logic in which deontic operators operate on terms rather than on formulæ. In a second step we distinguish between what we call real and deontic actions.     

Algebras of Intervals and a Logic of Conditional Assertions

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, ukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates.     

Problems and results for logics about imperatives

Deviating from standard possible-worlds semantics, authors belonging to what might be called the ‘imperative tradition’ of deontic logic have proposed a semantics that directly represents norms (or imperatives). The paper examines possible definitions of (monadic) deontic operators in such a semantics and some properties of the resulting logical systems.     

A First Order Nonmonotonic Extension of Constructive Logic

Certain extensions of Nelson's constructive logic N with strong negation have recently become important in arti.cial intelligence and nonmonotonic reasoning, since they yield a logical foundation for answer set programming (ASP). In this paper we look at some extensions of Nelson's .rst-order logic as a basis for de.ning nonmonotonic inference relations that underlie the answer set programming semantics. The extensions we consider are those based on 2-element, here-and-there Kripke frames. In particular, we prove completeness for .rst-order here-and-there logics, and their minimal strong negation extensions, for both constant and varying domains. We choose the constant domain version, which we denote by QN^c₅, as a basis for de.ning a .rst-order nonmonotonic extension called equilibrium logic. We establish several metatheoretic properties of QN^c₅, including Skolem forms and Herbrand theorems and Interpolation, and show that the .rst-oder version of equilibrium logic can be used as a foundation for answer set inference.     

The seven virtues of simple type theory

Simple type theory, also known as higher-order logic, is a natural extension of first-order logic which is simple, elegant, highly expressive, and practical. This paper surveys the virtues of simple type theory and attempts to show that simple type theory is an attractive alternative to first-order logic for practical-minded scientists, engineers, and mathematicians. It recommends that simple type theory be incorporated into introductory logic courses offered by mathematics departments and into the undergraduate curricula for computer science and software engineering students.     

Completeness and conservative extension results for some boolean relevant logics

This paper presents completeness and conservative extension results for the boolean extensions of the relevant logic T of Ticket Entailment, and for the contractionless relevant logics TW and RW. Some surprising results are shown for adding the sentential constant t to these boolean relevant logics; specifically, the boolean extensions with t are conservative of the boolean extensions without t, but not of the original logics with t. The special treatment required for the semantic normality of T is also shown along the way.