Many-sorted hybrid modal languages
| Autor: | Traian Florin Şerbănuţă, Ioana Leustean, Natalia Moanga |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Logic Semantics (computer science) Programming language Computer science Modal logic 0102 computer and information sciences computer.software_genre Translation (geometry) 01 natural sciences Logic in Computer Science (cs.LO) Theoretical Computer Science TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Modal Computational Theory and Mathematics Fragment (logic) 010201 computation theory & mathematics TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Hybrid logic computer Software |
| Zdroj: | Journal of Logical and Algebraic Methods in Programming. 120:100644 |
| ISSN: | 2352-2208 |
| DOI: | 10.1016/j.jlamp.2021.100644 |
| Popis: | We continue our investigation into hybrid polyadic multi-sorted logic with a focus on expresivity related to the operational and axiomatic semantics of rogramming languages, and relations with first-order logic. We identify a fragment of the full logic, for which we prove sound and complete deduction and we show that it is powerful enough to represent both the programs and their semantics in an uniform way. Although weaker than other hybrid systems previously developed, this system is expected to have better computational properties. Finally, we provide a standard translation from full hybrid many-sorted logic to first-order logic. Comment: arXiv admin note: text overlap with arXiv:1905.05036, arXiv:1907.05029 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect