G. Ramalingam
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.
Related
Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011