Guarded Negation

DOI10.1007/978-3-642-22012-8_28zbMath1333.68132OpenAlexW2914576081MaRDI QIDQ5892612

Balder ten Cate, Luc Segoufin, Vince Bárány

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

On the Decidability of Elementary Modal Logics ⋮ Effective Interpolation and Preservation in Guarded Logics ⋮ Bisimulation quantifiers and uniform interpolation for guarded first order logic ⋮ Unnamed Item ⋮ Guarded Negation

Cites Work

• Elements of finite model theory.
• Modal languages and bounded fragments of predicate logic
• Undecidability results on two-variable logics
• Games and Model Checking for Guarded Logics
• On languages with two variables
• On the Restraining Power of Guards
• Querying the Guarded Fragment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guarded Negation