The decision problem for branching time logic
From MaRDI portal
Publication:3708772
Recommendations
Cites work
Cited in
(26)- Temporal Logics with Reference Pointers and Computation Tree Logics
- Notes on monadic logic. Part B: Complexity of linear orders in ZFC
- Pure Logic with Branched Quantifiers
- Composition over the natural number ordering with an extra binary relation
- Decision procedures and expressiveness in the temporal logic of branching time
- Counting on CTL\(^*\): On the expressive power of monadic path logic
- First-order definability of transition structures
- An infinite hierarchy of temporal logics over branching time
- A system of dynamic modal logic
- More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\)
- TABLEAUX: A general theorem prover for modal logics
- Path logics with synchronization
- scientific article; zbMATH DE number 4006233 (Why is no real title available?)
- scientific article; zbMATH DE number 2084388 (Why is no real title available?)
- Completeness of a branching-time logic with possible choices
- Quantification over sets of possible worlds in branching-time semantics
- Arity hierarchy for temporal logics
- Системы временной логики I: моменты, истории, деревья
- Finite and Circular Path Models for Branching Time Logics
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- Rules and Refutation Rules for the Logic of Finite n-ary Trees
- A finite axiomatization of the set of strongly valid Ockhamist formulas
- A decidable temporal logic of parallelism
- Notes on monadic logic. A: Monadic theory of the real line
- Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees
- An improved lower bound for the elementary theories of trees
This page was built for publication: The decision problem for branching time logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3708772)
