The decision problem for branching time logic
Keyword(s):
AbstractThe theory of trees with additional unary predicates and quantification over nodes and branches embraces a rich branching time logic. This theory was reduced in the companion paper to the first-order theory of binary, bounded, well-founded trees with additional unary predicates. Here we prove the decidability of the latter theory.
1976 ◽
Vol 41
(2)
◽
pp. 460-464
◽
1987 ◽
Vol 29
(2)
◽
pp. 459-475
◽
Keyword(s):
1992 ◽
Vol 13
(3)
◽
pp. 255-299
◽
Keyword(s):
1992 ◽
Vol 13
(3)
◽
pp. 301-327
◽
Keyword(s):
Keyword(s):
2015 ◽
Vol 57
(2)
◽
pp. 157-185
◽