A Many-sorted Polyadic Modal Logic
| Autor: | Traian Florin Serbanuta, Natalia Moanga, Ioana Leustean |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Algebra and Number Theory Matching (graph theory) Generalization Computer science Process (computing) Modal logic 0102 computer and information sciences 01 natural sciences Logic in Computer Science (cs.LO) Theoretical Computer Science Algebra TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computational Theory and Mathematics Algebraic semantics Fragment (logic) 010201 computation theory & mathematics Connection (algebraic framework) Information Systems |
| Zdroj: | Fundamenta Informaticae. 173:191-215 |
| ISSN: | 1875-8681 0169-2968 |
| DOI: | 10.3233/fi-2020-1921 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|