English
Related papers

Related papers: A Note on Nesting in Dyadic Deontic Logic

200 papers

In the last decade, formal logics have been used to model a wide range of ethical theories and principles with the goal of using these models within autonomous systems. Logics for modeling ethical theories, and their automated reasoners,…

Artificial Intelligence · Computer Science 2020-01-01 Naveen Sundar Govindarajulu , Selmer Bringsjord , Matthew Peveler

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…

Logic · Mathematics 2023-10-05 Carlos Caleiro , Sérgio Marcelino , Umberto Rivieccio

In this paper, we propose a definition of Neron models of arbitrary Deligne 1-motives over Dedekind schemes, extending Neron models of semi-abelian varieties. The key property of our Neron models is that they satisfy a generalization of…

Number Theory · Mathematics 2019-11-01 Takashi Suzuki

This paper presents an extension of Defeasible Deontic Logic to deal with the Pragmatic Oddity problem. The logic applies three general principles: (1) the Pragmatic Oddity problem must be solved within a general logical treatment of CTD…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Silvano Colombo Tosatto , Antonino Rotolo

This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…

Logic in Computer Science · Computer Science 2018-12-03 Ioana Leustean , Natalia Moanga , Traian Florin Serbanuta

Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…

Logic in Computer Science · Computer Science 2010-09-02 Andrew Gacek , Dale Miller , Gopalan Nadathur

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

Systems of deontic logic suffer either from being too expressive and therefore hard to mechanize, or from being too simple to capture relevant aspects of normative reasoning. In this article we look for a suitable way in between: the…

Artificial Intelligence · Computer Science 2018-10-24 Tomer Libal , Matteo Pascucci

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Logic · Mathematics 2022-09-20 Petr Cintula , George Metcalfe , Naomi Tokuda

This paper develops a logic based on causal inferences to formally capture the concept of instrumental obligation. We establish a causal deontic model that extends causal models with priority structures, allowing us to represent both the…

Logic · Mathematics 2025-05-13 Jialiang Yan , Qingyu He

We introduce the notion of a G\"odel fibration, which is a fibration categorically embodying both the logical principle of traditional Skolemization (we can exchange the order of quantifiers paying the price of a functional) and the…

Category Theory · Mathematics 2021-04-30 Davide Trotta , Matteo Spadetto , Valeria de Paiva

Let G be a simple algebraic group over the complex numbers. Let N be the cone of nilpotent elements in the Lie algebra of G. Let K_{G x C^*}(N) denote the Grothendieck group of the category of G x C^*-equivariant coherent sheaves on N. In…

Algebraic Geometry · Mathematics 2007-05-23 Viktor Ostrik

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

Dynamic Topological Logic (DTL) is a multimodal system for reasoning about dynamical systems. It is defined semantically and, as such, most of the work done in the field has been model-theoretic. In particular, the problem of finding a…

Logic · Mathematics 2012-01-26 David Fernández Duque

Besides the better-known Nelson logic (N3) and paraconsistent logic (N4), in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called S. The logic S was originally presented by means of a calculus…

Logic · Mathematics 2019-09-24 Thiago Nascimento , Umberto Rivieccio , Joao Marcos , Matthew Spinks

We present SBTrust, a logical framework designed to formalize decision trust. Our logic integrates a doxastic modality with a novel non-monotonic conditional operator that establishes a positive support relation between statements, and is…

Logic in Computer Science · Computer Science 2025-12-03 Alessandro Aldini , Agata Ciabattoni , Dominik Pichler , Mirko Tagliaferri

G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…

Logic in Computer Science · Computer Science 2015-07-01 Matthias Baaz , Agata Ciabattoni , Christian G Fermüller

Besides the better-known Nelson's Logic and Paraconsistent Nelson's Logic, in "Negation and separation of concepts in constructive systems" (1959), David Nelson introduced a logic called S with the aim of analyzing the constructive content…

Logic · Mathematics 2018-06-12 Thiago Nascimento , Umberto Rivieccio , João Marcos , Matthew Spinks
‹ Prev 1 3 4 5 6 7 10 Next ›