Handbook of theoretical computer science (vol. B)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |
In this paper we discuss time in paraconsistency and paracompleteness. We introduce briefly the temporal logical system Δ1 which may constitute, for instance, a framework for non-alethic temporal reasoning.