The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Temporal logics and their intuitionistic counterparts are of growing importance in Computer Science. These intuitionistic counterparts, called intuitionistic (or constructive) temporal logics, are known to be useful for formalizing functional programming. To show a clear relationship between temporal logics and their intuitionistic counterparts has thus been required. In this paper, a theorem for embedding first-order linear-time temporal logic into its intuitionistic counterpart is proved using Baratella-Masini's temporal extension of the Gödel-Gentzen negative translation of classical logic into intuitionistic logic.