- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The decision problem for branching time logic
Journal of Symbolic Logic 50 (3):668-681 (1985)
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 theoryOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
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.
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
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.
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
109 (#193,760)
6 months
19 (#148,073)
2009-01-28
Downloads
109 (#193,760)
6 months
19 (#148,073)
Historical graph of downloads
Citations of this work
A Decidable Temporal Logic of Parallelism.Mark Reynolds - 1997 - Notre Dame Journal of Formal Logic 38 (3):419-436.
Quantification over Sets of Possible Worlds in Branching-Time Semantics.Alberto Zanardo - 2006 - Studia Logica 82 (3):379-400.
A system of dynamic modal logic.Maarten de Rijke - 1998 - Journal of Philosophical Logic 27 (2):109-142.
First-Order Definability of Transition Structures.Antje Rumberg & Alberto Zanardo - 2019 - Journal of Logic, Language and Information 28 (3):459-488.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-f8568656d-d9z9s uwo