Modal logics and local quantifiers: a zoo in the elementary hierarchy
From MaRDI portal
Publication:6181934
DOI10.1007/978-3-030-99253-8_16OpenAlexW4226219612MaRDI QIDQ6181934
Raul Fervari, Alessio Mansutti
Publication date: 23 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-99253-8_16
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propositional logics of dependence
- Graded modalities. I
- Modal languages and bounded fragments of predicate logic
- A note on graded modal logic
- Hybrid logics: characterization, interpolation and complexity
- Complexity Hierarchies beyond Elementary
- Deciding validity in a spatial logic for trees
- The complexity of propositional linear temporal logics
- Alternation
- Propositional quantifiers in modal logic1
- Complexity of Propositional Logics in Team Semantic
- Relation-changing modal operators: Fig. 1.
- The Complexity of Satisfiability for Fragments of CTL and CTL⋆
- Modal Logics with Composition on Finite Forests
- The power of modal separation logics
- Computer Science Logic
- On modal logic with propositional quantifiers
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Mechanizing Mathematical Reasoning
