English
Related papers

Related papers: Deontic Action Logics: A Modular Algebraic Perspec…

200 papers

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

New actions in D=2 and D=3 are proposed that are dual equivalent to known theories displaying well defined chirality and helicity, respectively, along with a new interpolating action that maps continuously through the original dualities.…

High Energy Physics - Theory · Physics 2007-12-03 E. M. C. Abreu , A. Calil , L. S. Grigorio , M. S. Guimaraes , C. Wotzasek

We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (`Modal logics with Belnapian truth values', J. Appl. Non-Class. Log. 20, 279--301 (2010)). We…

Logic in Computer Science · Computer Science 2016-08-23 Igor Sedlár

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

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…

Logic in Computer Science · Computer Science 2017-01-11 Jiri Adamek , Stefan Milius , Jiri Velebil

We consider a learning agent in a partially observable environment, with which the agent has never interacted before, and about which it learns both what it can observe and how its actions affect the environment. The agent can learn about…

Artificial Intelligence · Computer Science 2021-09-14 Thomas Bolander , Nina Gierasimczuk , Andrés Occhipinti Liberman

This is a book about Partial Actions and Fell Bundles with applications to C*-algebras generated by partial isometries. Here is the table of contents: 1-Introduction, 2-Partial actions, 3-Restriction and globalization, 4-Inverse semigroups,…

Operator Algebras · Mathematics 2017-08-30 Ruy Exel

We review and interpret two basic propositions published by Ellerman (2014). The propositions address the algebraic structure of T accounts and double entry bookkeeping (DEB). The paper builds on this previous contribution with the view of…

General Economics · Economics 2019-06-27 Frederico Botafogo

In this paper, we propose a framework to extract the algebra of the transformations of worlds from the perspective of an agent. As a starting point, we use our framework to reproduce the symmetry-based representations from the…

Artificial Intelligence · Computer Science 2026-03-20 Alexander Dean , Eduardo Alonso , Esther Mondragon

We study an extension of \g propositional logic whose corresponding algebra is an ordered Abelian group. Then we expand the ideas to first-order case of this logic.

Logic · Mathematics 2018-11-09 Seyed Mohammad Amin Khatami

We propose various methods for combining or amalgamating propositional languages and deductive systems. We make heavy use of quantales and quantale modules in the wake of previous works by the present and other authors. We also describe…

Logic · Mathematics 2022-02-02 Ciro Russo

In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…

Logic · Mathematics 2023-06-06 Paolo Aglianò

This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this…

Logic · Mathematics 2011-12-19 Frederic Dambreville

This paper introduces modal independence logic MIL, a modal logic that can explicitly talk about independence among propositional variables. Formulas of MIL are not evaluated in worlds but in sets of worlds, so called teams. In this vein,…

Logic in Computer Science · Computer Science 2014-04-02 Juha Kontinen , Julian-Steffen Müller , Henning Schnoor , Heribert Vollmer

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

Logic in Computer Science · Computer Science 2026-05-19 Hirohiko Kushida

The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…

Combinatorics · Mathematics 2020-12-02 Leonardo N. Coregliano , Alexander A. Razborov

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

Dynamic Topological Logic ($\mathcal{DTL}$) is a combination of $\mathcal{S}${\em 4}, under its topological interpretation, and the temporal logic $\mathcal{LTL}$ interpreted over the natural numbers. $\mathcal{DTL}$ is used to reason about…

Logic · Mathematics 2016-11-22 David Fernández-Duque

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

Recently an extension to higher-order logic -- called DHOL -- was introduced, enriching the language with dependent types, and creating a powerful extensional type theory. In this paper we propose two ways how choice can be added to DHOL.…

Logic in Computer Science · Computer Science 2024-10-14 Daniel Ranalter , Chad E. Brown , Cezary Kaliszyk