Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Kozen:1981:EPC,
author = "D. Kozen and R. Parikh",
title = "An elementary proof of the completeness of {PDL}",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "113--118",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; formal logic; PDL; Propositional Dynamic
Logic; Segerberg axioms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}