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

Review

Data aggregation architectures for single-chip SDH/SONET framers

Rolf Clauberg

IBM J. Res. Dev

Conference paper

Automatic taxonomy generation: Issues and possibilities

Raghu Krishnapuram, Krishna Kummamuru

IFSA 2003

Paper

Mapping behavioral specifications to model parameters in synthetic biology

Heinz Koeppl, Marc Hafner, et al.

BMC Bioinformatics

Paper

DESIGN OF THE REXX LANGUAGE.

M.F. Cowlishaw

IBM Systems Journal

View all publications