scientific article
From MaRDI portal
Publication:3768883
zbMath 0632.03027</link>MaRDI QID Q3768883</link>
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
monadic second-order logictense logicexpressive powerKamp's theoremfull branching time logicmonadic second- order theory of the binary tree
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)
Related Items (28)
Limiting Until in Ordered Tree Query Languages ⋮ Functional Specification of Hardware via Temporal Logic ⋮ A clausal resolution method for branching-time logic \(\text{ECTL}^+\) ⋮ Counting on CTL\(^*\): On the expressive power of monadic path logic ⋮ On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic ⋮ Reasoning About Substructures and Games ⋮ On temporal logic versus Datalog ⋮ \textit{Once} and \textit{for all} ⋮ SnS can be modally characterized ⋮ Formal logical language to set requirements for secure code execution ⋮ Definability with bounded number of bound variables ⋮ A hierarchy of temporal logics with past ⋮ Alternating-time temporal logics with linear past ⋮ Infinite trees and automaton-definable relations over \(\omega\)-words ⋮ Model Theoretic Syntax and Parsing ⋮ Unnamed Item ⋮ \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) ⋮ From Philosophical to Industrial Logics ⋮ Characterizing EF and EX tree logics ⋮ Unnamed Item ⋮ From Monadic Logic to PSL ⋮ The Complexity of CTL* + Linear Past ⋮ Temporal logic with recursion ⋮ On the Complexity of Branching-Time Logics ⋮ From liveness to promptness ⋮ An axiomatization of PCTL* ⋮ Branching-time logics repeatedly referring to states ⋮ An infinite hierarchy of temporal logics over branching time
This page was built for publication: