Abstract
Harel proved that the dynamic logic is complete in the class of arithmetical interpretations. The set of natural numbers stands for primitive notion in arithmetical interpretations, i.e. the following condition holds: "there exists a unary relation symbol nat such that for every arithmetical interpretation I, natI is the set of natural numbers". It is proved that the completeness is lost when this condition is relaxed to the following one: "for every interpretationI involved, the set of natural numbers is first-order definable in I". Thus we prove that the dynamic logic is not relatively complete in the sense of Cook.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Clarke E., M. Jr., The characterization problem for Hoare Logics, Carnegie-Mellon Univ. report CMU-CS-84-109, 1984
Grabowski M., On relative incompleteness of logics for total correctness, Proc. of Logics of Programs 85 conf., New York, Brooklyn, Lect. Notes in Comp. Sc., 1985
Harel D., Logics of programs: axiomatics and descriptive power, Report MIT/LCS/TR-200, 1978
Shoenfield J., Mathematical Logic, 1967
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grabowski, M. (1985). Non-uniformity of dynamic logic. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive