A Sound and Complete Axiomatic System for Modality $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$
Abstract
An axiomatic system is presented in this paper, which has a modal operator □ such that $\Box\phi\equiv\Box_1\phi\land\Box_2\phi$, where □1 and □2 are the modal operators of the language for the axiom system S5. The axiomatic system for □ is proved to be sound and complete.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
Loading...
