Publication
Theoretical Computer Science
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.
We give an elementary proof of the completeness of the Segerberg axions for Propositional Dynamic Logic. © 1981.