Deterministic dynamic logic of recursive programs is weaker than dynamic logic

Piotr Berman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations
Original languageEnglish (US)
Title of host publicationFoundations of Computation Theory - Proceedings of the 1983 International FCT-Conference
EditorsMarek Karpinski
PublisherSpringer Verlag
Pages14-25
Number of pages12
ISBN (Print)9783540126898
DOIs
StatePublished - Jan 1 1983
EventInternational Symposium on Fundamentals of Computation Theory, FCT 1983 - Borgholm, Sweden
Duration: Aug 21 1983Aug 27 1983

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume158 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Symposium on Fundamentals of Computation Theory, FCT 1983
CountrySweden
CityBorgholm
Period8/21/838/27/83

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Berman, P. (1983). Deterministic dynamic logic of recursive programs is weaker than dynamic logic. In M. Karpinski (Ed.), Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference (pp. 14-25). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 158 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-12689-9_90