Publication
Theoretical Computer Science
Paper

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.

Date

01 Jan 1981

Publication

Theoretical Computer Science

Authors

Topics

Share