Back and forth between guarded and modal logics

DOI10.1145/507382.507388zbMath1365.03019OpenAlexW2179506702MaRDI QIDQ5738962

Martin Otto, Colin Hirsch, Erich Grädel

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/507382.507388

zbMATH Keywords

modal logicmodel theorybisimulationguarded logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (14)

On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ Modal and guarded characterisation theorems over finite transition systems ⋮ Provenance Circuits for Trees and Treelike Instances ⋮ The mu-calculus and Model Checking ⋮ Unnamed Item ⋮ On the complexity of division and set joins in the relational algebra ⋮ Bisimulation invariant monadic-second order logic in the finite ⋮ Finite satisfiability for guarded fixpoint logic ⋮ The Descriptive Complexity of Parity Games ⋮ Bisimulation Invariant Monadic-Second Order Logic in the Finite ⋮ A general tableau method for propositional interval temporal logics: theory and implementation ⋮ Separating Graph Logic from MSO ⋮ Repetitions and permutations of columns in the semijoin algebra ⋮ Where First-Order and Monadic Second-Order Logic Coincide

This page was built for publication: Back and forth between guarded and modal logics