Article ID Journal Published Year Pages File Type
9657959 Theoretical Computer Science 2005 25 Pages PDF
Abstract
We raise the questions of the expressiveness and the minimality of these logics. Our main contribution is a minimalisation technique we may apply for these two logics. We moreover show some restrictions of this technique for the extension SAL∀ with universal quantification, and we establish the minimality of the adjunct-free fragment (SALint).
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,