Journal of Symbolic Logic

The Decision Problem for Branching Time Logic

Yuri Gurevich and Saharon Shelah

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 50, Issue 3 (1985), 668-681.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183741904

Mathematical Reviews number (MathSciNet)
MR805676

Zentralblatt MATH identifier
0584.03006

JSTOR
links.jstor.org

Citation

Gurevich, Yuri; Shelah, Saharon. The Decision Problem for Branching Time Logic. J. Symbolic Logic 50 (1985), no. 3, 668--681. https://projecteuclid.org/euclid.jsl/1183741904


Export citation