The Decision Problem for Branching Time Logic

Gurevich, Yuri; Shelah, Saharon

J. Symbolic Logic, Tome 50 (1985) no. 1, p. 668-681 / Harvested from Project Euclid

Résumé

The 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.

Publié le : 1985-09-14
Classification:

@article{1183741904,
     author = {Gurevich, Yuri and Shelah, Saharon},
     title = {The Decision Problem for Branching Time Logic},
     journal = {J. Symbolic Logic},
     volume = {50},
     number = {1},
     year = {1985},
     pages = { 668-681},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741904}
}

Gurevich, Yuri; Shelah, Saharon. The Decision Problem for Branching Time Logic. J. Symbolic Logic, Tome 50 (1985) no. 1, pp.  668-681. http://gdmltest.u-ga.fr/item/1183741904/