Many-sorted hybrid modal languages
From MaRDI portal
Publication:2035658
DOI10.1016/j.jlamp.2021.100644OpenAlexW3122067392MaRDI QIDQ2035658
Ioana Leuştean, Traian-Florin Şerbănuţă, Natalia Moangă
Publication date: 25 June 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.01709
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pure extensions, proof rules, and hybrid axiomatics
- Modal logic with names
- A structural approach to operational semantics
- Birkhoff completeness for hybrid-dynamic first-order logic
- Operational semantics and program verification using many-sorted hybrid modal logic
- Foundations of logic programming in hybrid logics with user-defined sharing
- Sahlqvist Formulas in Hybrid Polyadic Modal Logics
- Hybrid completeness
- Hybrid languages and temporal logic
- Institutions: abstract model theory for specification and programming
- Matching Logic
- Forcing and Calculi for Hybrid Logics
- A Many-sorted Polyadic Modal Logic
- An axiomatic basis for computer programming
This page was built for publication: Many-sorted hybrid modal languages
