Deterministic dynamic logic of recursive programs is weaker than dynamic logic

Piotr Berman

doi:10.1007/3-540-12689-9_90

Deterministic dynamic logic of recursive programs is weaker than dynamic logic

Piotr Berman

Eberly College of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Original language	English (US)
Title of host publication	Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference
Editors	Marek Karpinski
Publisher	Springer Verlag
Pages	14-25
Number of pages	12
ISBN (Print)	9783540126898
DOIs	https://doi.org/10.1007/3-540-12689-9_90
State	Published - 1983
Event	International Symposium on Fundamentals of Computation Theory, FCT 1983 - Borgholm, Sweden Duration: Aug 21 1983 → Aug 27 1983

Publication series

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

Other

Other	International Symposium on Fundamentals of Computation Theory, FCT 1983
Country/Territory	Sweden
City	Borgholm
Period	8/21/83 → 8/27/83

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-12689-9_90

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

Berman, Piotr. / Deterministic dynamic logic of recursive programs is weaker than dynamic logic. Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference. editor / Marek Karpinski. Springer Verlag, 1983. pp. 14-25 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5781acf6633a48e99e3eede4ec5e2062,

title = "Deterministic dynamic logic of recursive programs is weaker than dynamic logic",

author = "Piotr Berman",

year = "1983",

doi = "10.1007/3-540-12689-9_90",

language = "English (US)",

isbn = "9783540126898",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "14--25",

editor = "Marek Karpinski",

booktitle = "Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference",

address = "Germany",

note = "International Symposium on Fundamentals of Computation Theory, FCT 1983 ; Conference date: 21-08-1983 Through 27-08-1983",

}

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 158 LNCS, Springer Verlag, pp. 14-25, International Symposium on Fundamentals of Computation Theory, FCT 1983, Borgholm, Sweden, 8/21/83. https://doi.org/10.1007/3-540-12689-9_90

Deterministic dynamic logic of recursive programs is weaker than dynamic logic. / Berman, Piotr.
Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference. ed. / Marek Karpinski. Springer Verlag, 1983. p. 14-25 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 158 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Deterministic dynamic logic of recursive programs is weaker than dynamic logic

AU - Berman, Piotr

PY - 1983

Y1 - 1983

UR - http://www.scopus.com/inward/record.url?scp=84913408474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84913408474&partnerID=8YFLogxK

U2 - 10.1007/3-540-12689-9_90

DO - 10.1007/3-540-12689-9_90

M3 - Conference contribution

AN - SCOPUS:84913408474

SN - 9783540126898

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 14

EP - 25

BT - Foundations of Computation Theory - Proceedings of the 1983 International FCT-Conference

A2 - Karpinski, Marek

PB - Springer Verlag

T2 - International Symposium on Fundamentals of Computation Theory, FCT 1983

Y2 - 21 August 1983 through 27 August 1983

ER -

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

Deterministic dynamic logic of recursive programs is weaker than dynamic logic

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this