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

Paper

Iterative Toeplitz solvers with local quadratic convergence

Elliot Linzer, M. Vetterli

Computing

Paper

DESIGN OF THE REXX LANGUAGE.

M.F. Cowlishaw

IBM Systems Journal

Conference paper

Measurement, modeling, and analysis of internet video sharing site workload: A case study

Xiaozhu Kang, Hui Zhang, et al.

ICWS 2008

View all publications