A many-sorted polyadic modal logic

DOI10.3233/FI-2020-1921MaRDI QIDQ5134276zbMATH OpenFDO

Authors Natalia Moangă, Traian Şerbănuţă, Ioana Leuştean

Publication date 16 November 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.09709

zbMATH Keywords

Boolean algebras with operatorsJónsson-Tarski theoremmany-sorted algebrasmany-sorted logicoperational semanticspolyadic modal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Cylindric and polyadic algebras; relation algebras (03G15) Other algebras related to logic (03G25) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Abstract: 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'onsson-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.

Recommendations

• Many-sorted hybrid modal languages
• scientific article; zbMATH DE number 3982508
• Modal logics withn-ary connectives
• scientific article; zbMATH DE number 3845548
• Many-sorted coalgebraic modal logic: A model-theoretic study

Cited in

(9)

• Many-sorted hybrid modal languages
• Operational semantics and program verification using many-sorted hybrid modal logic
• Modal logics withn-ary connectives
• Exploring a syntactic notion of modal many-valued logics
• Abstract valuation semantics
• Polynomial semantics for modal logics
• On the logical and algebraic aspects of reasoning with formal contexts
• Hybrid many-sorted modal logic with nominal terms
• Training as inference: using hybrid modal logic for specifying neural networks

This page was built for publication: A many-sorted polyadic modal logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134276)