M.F. Cowlishaw
IBM Systems Journal
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
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum