An essay in combinatory dynamic logic
Information and Computation
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Annals of Mathematics and Artificial Intelligence
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Hi-index | 0.01 |
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x, y)which states that two time points are at the same distance from the root. We provide the systems studied with complete axiomatizations and illustratethe expressive power gained for modal logic by simulating other logics. The completeness proofs rely on the fairly intuitive notion of a configuration in order to use a proof technique similar to a Henkin completion mixed with a tableau construction. The main elements of thecompleteness proofs are given for each case, while purely technical results are grouped in the appendix.