A many-sorted polyadic modal logic

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 of the Jónsson-Tarski theorem. While the transition from the...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Leustean, Ioana, Moanga, Natalia, Traian Florin Serbanuta
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 30.11.2018
Subjects
Boolean algebra
Logic
Program verification (computers)
Semantics
Online AccessGet full text

Cover

More Information
Summary: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 of the Jónsson-Tarski theorem. While the transition from the mono-sorted logic to many-sorted one is a smooth process, we see our system as a step towards deepening the connection between modal logic and program verification, since our system can be seen as the propositional fragment of Matching logic, a first-order logic for specifying and reasoning about programs.
ISSN:2331-8422