On Some Aspects of Decidability of Annotated Systems

摘要

In this paper, we discuss some results of decidability of annotated systems. The annotated propositional logic P and its S5 type modal extension S5 are shown to be decidable. These results reveal that annotated systems are computationally attractive as the foundations of paraconsistent reasoning.