The decision problem for branching time logic

&
Journal of Symbolic Logic 50 (3):668-681 (1985)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.2307/2274321

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,899

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Axiom of Choice in Second‐Order Predicate Logic.Christine Gaßner - 1994 - Mathematical Logic Quarterly 40 (4):533-546.
Finite Trees in Tense Logic.Bellissima Fabio & Cittadini Saverio - 1999 - Studia Logica 62 (2):121-140.
Branching-time logic with quantification over branches: The point of view of modal logic.Alberto Zanardo - 1996 - Journal of Symbolic Logic 61 (1):1-39.
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
Yuri Gurevich and Saharon Shelah. On finite rigid structures. The journal of symbolic logic, vol. 61 , pp. 549–562. [REVIEW]Alexei P. Stolboushkin - 2000 - Bulletin of Symbolic Logic 6 (3):353-355.
Recursive unary algebras and trees.Bakhadyr Khoussainov - 1994 - Annals of Pure and Applied Logic 67 (1-3):213-268.
On spectra of sentences of monadic second order logic with counting.E. Fischer & J. A. Makowsky - 2004 - Journal of Symbolic Logic 69 (3):617-640.
Expansion of a model of a weakly o-minimal theory by a family of unary predicates.Bektur Sembiuly Baizhanov - 2001 - Journal of Symbolic Logic 66 (3):1382-1414.

Analytics

Added to PP
2009-01-28

Downloads
122 (#187,070)

6 months
23 (#138,344)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A system of dynamic modal logic.Maarten de Rijke - 1998 - Journal of Philosophical Logic 27 (2):109-142.
A Decidable Temporal Logic of Parallelism.Mark Reynolds - 1997 - Notre Dame Journal of Formal Logic 38 (3):419-436.
First-Order Definability of Transition Structures.Antje Rumberg & Alberto Zanardo - 2019 - Journal of Logic, Language and Information 28 (3):459-488.
Temporal logic.Antony Galton - 2008 - Stanford Encyclopedia of Philosophy.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references