Theoretical Computer Science

Paper

01 Jan 1981

An elementary proof of the completeness of PDL

View publication

Abstract

We give an elementary proof of the completeness of the Segerberg axions for Propositional Dynamic Logic. © 1981.

Related

Paper

On sparse evaluation representations

G. Ramalingam

Theoretical Computer Science

Paper

An integrated approach to federated identity and privilege management in open systems

Rafae Bhatti, Elisa Bertino, et al.

Communications of the ACM

Paper

Automated search method for AFM and profilers

Michael Ray, Yves C. Martin

Proceedings of SPIE - The International Society for Optical Engineering

Review

Data aggregation architectures for single-chip SDH/SONET framers

Rolf Clauberg

IBM J. Res. Dev

View all publications