Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Paper
An elementary proof of the completeness of PDL
Abstract
We give an elementary proof of the completeness of the Segerberg axions for Propositional Dynamic Logic. © 1981.
Related
David A. Selby
IBM J. Res. Dev
G. Ramalingam
Theoretical Computer Science
Conference paper
Strong and flexible domain typing for dynamic E-business
Yigal Hoffner, Simon Field, et al.
EDOC 2004