scientific article; zbMATH DE number 7577569

MaRDI QIDQ5101338

Stéphane P. Demri, Bartosz Bednarczyk

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2104.13122

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

satisfiability problemcomputational tree logic CTLmodal logic over treespropositional quantifiertower-hardness

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

On Composing Finite Forests with Modal Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second-order propositional modal logic and monadic alternation hierarchies
• The complexity of one-agent refinement modal logic
• Augmenting ATL with strategy contexts
• Graded modalities. I
• Self-reference and modal logic
• The complementation problem for Büchi automata with applications to temporal logic
• The complexity of logical theories
• On propositional quantifiers in provability logic
• Propositional quantification in the topological semantics for \(\mathbf S4\)
• Quantified computation tree logic
• Second-order propositional modal logic: expressiveness and completeness results
• Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\)
• The expressive power of second-order propositional modal logic
• Expressivity of second order propositional modal logic
• Relationships between nondeterministic and deterministic tape complexities
• In so many possible worlds
• PSPACE Reasoning for Graded Modal Logics
• Hybrid logics: characterization, interpolation and complexity
• Temporal Logics in Computer Science
• Complexity Hierarchies beyond Elementary
• Quantified CTL: Expressiveness and Complexity
• Deciding full branching time logic
• Alternation
• Using the Universal Modality: Gains and Questions
• A Decision Procedure for the First Order Theory of Real Addition with Order
• Propositional quantifiers in modal logic1
• Augmenting branching temporal logics with existential quantification over atomic propositions
• On the complexity of propositional quantification in intuitionistic logic
• The computational complexity of hybrid temporal logics
• On the Expressiveness of QCTL
• Modal logics of sabotage revisited
• Representability in second-order propositional poly-modal logic
• Modal Logics with Composition on Finite Forests
• THE FLUTED FRAGMENT REVISITED
• Mathematical Foundations of Computer Science 2003
• On modal logic with propositional quantifiers
• Decidability of Second-Order Theories and Automata on Infinite Trees
• An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning

This page was built for publication: