Process logic: Expressiveness, decidability, completeness
作者：
Highlights：
•
摘要
A process logic (PL) is defined that subsumes Pratt's process logic, Parikh's SOAPL, Nishimura's process logic, and Pnueli's Temporal Logic in expressiveness. The language of PL is an extension of the language of Propositional Dynamic Logic (PDL). A deductive system for PL is given which includes the Segerberg axioms for PDL and it is proved that it is complete. It is also shown that PL is decidable.
论文关键词：
论文评审过程：Received 4 May 1981, Revised 24 February 1982, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(82)90003-4
