| C. S. Stirling, Modal and temporal logics, Handbook of logic in comuter science (S. Abramsky, D. Gabbay, and T. Maibaum, editors), Oxford University Press, 1991, pp. 477-- 563. |
....) K4) #a## = # (K5) X. X ) # X. X ) K6) # X. X ) # (K7) X. X ) X. X ) The propositional calculus is an interesting logic because it is both expressive and manageable. It subsumes most propositional temporal logics and propositional modal logics of programs [2, 10, 16]. Over Kripke structures which are binary trees the logic is as expressive as S2S [12] monadic second order logic of two successors [14] On the other hand the validity A NOTE ON THE COMPLETENESS OF KOZEN S AXIOMATISATION 351 problem for calculus formulas is EXPTIME complete [3] This makes it ....
C. S. Stirling, Modal and temporal logics, Handbook of logic in comuter science (S. Abramsky, D. Gabbay, and T. Maibaum, editors), Oxford University Press, 1991, pp. 477-- 563.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC