Abstract
The author has previously introduced an operatorδ into dynamic logic which takes formulae to terms; the suggested reading ofδ A was “the bringing about of A” or “the seeing to it that A”. After criticism from S. K. Thomason and T. J. Surendonk the author now presents an improved version of his theory. The crucial feature is the introduction of an operatorOK taking terms to formulae; the suggested reading of OKα is “α always terminates”.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Robert Goldblatt,Axiomatising the logic of computer programming, Lecture Notes in Computer Science, vol. 130. Springer-Verlag, Berlin, Heidelberg, New York, 1982.
Krister Segerberg,A completeness theorem in the modal logic of programs, inUniversal algebra and applications, T. Traczyk (ed), PWN, Warsaw 1982, pp. 31–45.
Krister Segerberg,Models for action, inAnalytical philosophy in comparative perspective, B. K. Matilal and Jay Shaw (eds), D. Reidel Publ. Co. Dordrecht 1985, pp. 161–171.
Krister Segerberg,Bringing it about,Journal of philosophical logic 18 (1989), pp. 327–347.
Krister Segerberg,Validity and satisfaction in imperative logic,Notre Dame journal of formal logic, 31 (1990), pp. 203–221.
Krister Segerberg,Accepting failure in dynamic logic. To appear in the proceedings of the 9th International Congress of LMPS held at Uppsala in August 1991.
Krister Segerberg,How many logically constant actions are there?,Festschrift for Ray Jennings, to appear.
Timothy J. Surendonk,Making maximal reliable action maximal,Theoria, to appear.
S. K. Thomason,Dynamic logic and the logic of ability. To appear in the proceedings of a conference on modal logic held at Siena in May 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Segerberg, K. Action incompleteness. Stud Logica 51, 533–550 (1992). https://doi.org/10.1007/BF01028974
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01028974