Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422271 | Electronic Notes in Theoretical Computer Science | 2016 | 19 Pages |
Abstract
We present a graph approach to intuitionistic modal logics, which provides uniform formalisms for expressing, analysing and comparing Kripke-like semantics. This approach uses the flexibility of graph calculi to express directly and intuitively possible-world semantics for intuitionistic modal logics. We illustrate the benefits of these ideas by applying them to some familiar cases of intuitionistic multi-modal semantics.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paulo A.S. Veloso, Sheila R.M. Veloso,