scientific article; zbMATH DE number 4027441

MaRDI QIDQ3768883zbMATH OpenFDO

Authors Thilo Hafer, Wolfgang Thomas

Publication date 1987

zbMATH Keywords

monadic second-order logictense logicexpressive powerKamp's theoremfull branching time logicmonadic second- order theory of the binary tree

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Recommendations

• Counting on CTL^*: On the expressive power of monadic path logic
• Deciding full branching time logic
• scientific article; zbMATH DE number 1678388
• Publication:4733398
• scientific article; zbMATH DE number 4119650

Cited in

(37)

• The Common Fragment of ACTL and LTL
• Infinite trees and automaton-definable relations over -words
• Counting on CTL^*: On the expressive power of monadic path logic
• Dynamic logic of tree composition
• Monadic second order logic as the model companion of temporal logic
• An infinite hierarchy of temporal logics over branching time
• scientific article; zbMATH DE number 4119650 (Why is no real title available?)
• From liveness to promptness
• scientific article; zbMATH DE number 7577575 (Why is no real title available?)
• Axiomatizing the Monodic Fragment of
• Definability with bounded number of bound variables
• On the Complexity of Branching-Time Logics
• Alternating-time temporal logics with linear past
• Results on alternating-time temporal logics with linear past
• A clausal resolution method for branching-time logic \(\text{ECTL}^+\)
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
• \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
• scientific article; zbMATH DE number 2113953 (Why is no real title available?)
• A hierarchy of temporal logics with past
• \textit{Once} and \textit{for all}
• The Complexity of CTL* + Linear Past
• Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
• Limiting Until in ordered tree query languages
• Formal logical language to set requirements for secure code execution
• From Monadic Logic to PSL
• Functional specification of hardware via temporal logic
• Temporal logic with recursion
• Characterizing EF and EX tree logics
• From Philosophical to Industrial Logics
• SnS can be modally characterized
• Branching-time logics repeatedly referring to states
• Reasoning About Substructures and Games
• On temporal logic versus Datalog
• scientific article; zbMATH DE number 1678388 (Why is no real title available?)
• An axiomatization of PCTL*
• An axiomatization of full computation tree logic
• Model Theoretic Syntax and Parsing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768883)