Table of Contents
Fetching ...

Obligations and permissions, algebraically

Andrea De Domenico, Ali Farjami, Krishna Manoorkar, Alessandra Palmigiano, Mattia Panettiere, Xiaolong Wang

TL;DR

Precontact algebras are considered as a suitable algebraic environment for negative permission, and properties of several types of permission (negative, static, dynamic) are characterized by means of suitable modal languages encoding outputs.

Abstract

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In particular, we consider precontact algebras as a suitable algebraic environment for negative permission, and we characterize properties of several types of permission (negative, static, dynamic), as well as their interactions with normative systems, by means of suitable modal languages encoding outputs.

Obligations and permissions, algebraically

TL;DR

Precontact algebras are considered as a suitable algebraic environment for negative permission, and properties of several types of permission (negative, static, dynamic) are characterized by means of suitable modal languages encoding outputs.

Abstract

We further develop the algebraic approach to input/output logic initiated in \cite{wollic22}, where subordination algebras and a family of their generalizations were proposed as a semantic environment of various input/output logics. In particular, we consider precontact algebras as a suitable algebraic environment for negative permission, and we characterize properties of several types of permission (negative, static, dynamic), as well as their interactions with normative systems, by means of suitable modal languages encoding outputs.
Paper Structure (33 sections, 44 theorems, 28 equations, 1 table)

This paper contains 33 sections, 44 theorems, 28 equations, 1 table.

Key Result

Lemma 2.1

(cf. dedomenico2024obligations) For any logic $\mathcal{L} = (\mathrm{Fm}, \vdash)$,

Theorems & Definitions (99)

  • Lemma 2.1
  • Proposition 2.2
  • Proposition 2.3
  • Lemma 2.4
  • proof
  • Definition 2.5
  • Proposition 2.6
  • proof
  • Proposition 2.7
  • proof
  • ...and 89 more