On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity

DOI10.1007/11591191_22zbMath1143.03331OpenAlexW1552185231MaRDI QIDQ5387847

Wiesław Szwast, Lidia Tendera

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11591191_22

zbMATH Keywords

computational complexitytransitivityguarded fragmentdecision problemfinite model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

The guarded fragment with transitive guards ⋮ On the complexity of the two-variable guarded fragment with transitive guards ⋮ Complexity of hybrid logics over transitive frames

This page was built for publication: On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity