Abstract
The main purpose of the paper is to introduce philosophers and philosophical logicians to dynamic logic, a subject which promises to be of interest also to philosophy. A new completeness result involving both “after” — and “during” — operators is announced.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. J. Fischer and R. E. Ladner, Propositional modal logic of programs, extended abstract, presented at the Ninth. A. C. M. Symposium on the Theory of Computing, Boulder, Colorado, May 2–4, 1977.
D. Harel and V. R. Pratt, Nondeterminism in logics of programs, manuscript, dated November 10, 1977.
V. R. Pratt, Semantical considerations on Floyd-Hoare logic, 17th I.E.E.E. Symposium on Foundations of Computer Science (1977), pp. 109–121.
—, Logic of processes: manuscript, dated November 29, 1977.
—, Applications of modal logic to programming, this issue of Studia Logica.
A. Salomaa, Theory of Automata, Pergamon Press, London, 1969.
K. Segerberg, A completeness theorem in the modal logic of programs, to appear in the Stefan Banach International Mathematical Centre publications series.
—, A conjecture in dynamic logic, in: Mini-essays in honor of Juhani Pietarinen, Åbo, 1978, pp. 23–26.
Author information
Authors and Affiliations
Additional information
The work on this paper was supported in part by an Academy of Finland fellowship för längre hunna vetenskapsidkare during the former half of 1979. The paper itself was read as an invited address at the Conference on Practical and Philosophical Motivations of Non-classical Logics held at Toruń, August 15–19, 1979.
Rights and permissions
About this article
Cite this article
Segerberg, K. Applying modal logic. Stud Logica 39, 275–295 (1980). https://doi.org/10.1007/BF00370325
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370325