A decidability result for a second order process logic

Authors:
Rohit Parikh
Affiliations:
-
Venue:
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Year:
1978

Citing 0
Cited 5

BMS revisited

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Two results on process logic

Information Processing Letters
B and D are enough to make the Halpern-Shoham logic undecidable

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Axiomatizations Of Interval Logics

Fundamenta Informaticae
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove the decidability of the validity problem for a rather general language for talking about computations. As corollaries of our result, we obtain some decidability results of Pratt, Constable, Fischer-Ladner, and Pnueli and also a new decidability result for deterministic propositional dynamic logic.