top

Quantifiers in combinatory PDL: completeness, definability, incompleteness

S. Passy and T. Tinchev. Quantifiers in combinatory PDL: completeness, definability, incompleteness. In Fundamentals of Computation Theory FCT 85, LNCS, pp. 512–519, Springer, 1985.

Download: (unavailable)

Abstract:

(unavailable)

BibTeX: (download)

@INCOLLECTION{85:_quant_pdl,
  author = {S. Passy and T. Tinchev},
  title = {Quantifiers in combinatory PDL: completeness, definability, incompleteness},
  booktitle = {Fundamentals of Computation Theory FCT 85},
  publisher = {Springer},
  year = {1985},
  volume = {199},
  series = {LNCS},
  pages = {512--519},
}

Generated by bib2html.pl (written by Patrick Riley ) on Mon Aug 10, 2009 14:52:33