Finite satisfiability for guarded fixpoint logic

DOI10.1016/j.ipl.2012.02.005zbMath1243.68191arXiv1104.2262OpenAlexW1749183653MaRDI QIDQ436331

Mikołaj Bojańczyk, Vince Bárány

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

formal methodsguarded fragmentfinite satisfiabilityguarded fixpoint logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

On the complexity of team logic and its two-variable fragment, Guarded Negation

Cites Work

• Modal languages and bounded fragments of predicate logic
• On the Restraining Power of Guards
• Querying the Guarded Fragment
• Back and forth between guarded and modal logics
• Unnamed Item
• Unnamed Item