The expressibility of fragments of hybrid graph logic on finite digraphs

DOI10.1016/j.jal.2013.05.002zbMath1284.03206OpenAlexW2002657239MaRDI QIDQ2446549

Iain A. Stewart, James Gate

Publication date: 17 April 2014

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2013.05.002

zbMATH Keywords

modal logicfinite model theorypebble gameshybrid graph logicquantifier-rank

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Model theory of finite structures (03C13) Directed graphs (digraphs), tournaments (05C20)

Related Items

A logic for diffusion in social networks

Cites Work

• Unnamed Item
• The complexity of satisfiability for fragments of hybrid logic. I.
• Model checking for hybrid logic
• Hybridizing concept languages
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• Decision procedures and expressiveness in the temporal logic of branching time
• Model checking hybrid logics (with an application to semistructured data)
• Hybrid logics: characterization, interpolation and complexity
• A Logical Model of the Dynamics of Peer Pressure
• Using modal logics to express and check global graph properties
• The computational complexity of hybrid temporal logics
• Terminating Tableaux for Hybrid Logic with Eventualities
• Hybrid logic and its proof-theory