Linear logic appears as a suitable logical system for description of dynamic properties of various network activities in computer science. It disposes with new connectives which create new opportunities to describe properties of real network processes, e.g. parallelism, causality and commutativity of duality between processes. We extend this logic with Aristotelian modalities and we formulate their appropriate model. In our contribution we show how a real network attack can be formalized in this logical system as a polarized game.
In this paper the authors propose a method of verifying formulae in normal modal logics. In order to show that a formula α is a thesis of a normal modal logic, a set of decomposition rules for any formula is given. These decomposition rules are based on the symbols of assertion and rejection of formulae.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.