Decidability of the Guarded Fragment with the Transitive Closure

DOI10.1007/978-3-642-02930-1_22MaRDI QIDQ3638100zbMATH OpenOpenAlexFDO

Authors Jakub Michaliszyn

Publication date 14 July 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02930-1_22

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The guarded fragment with transitive guards
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• STACS 2005
• Computer Science Logic
• scientific article; zbMATH DE number 2086420

Cited in

(13)

• The guarded fragment with transitive guards
• Completeness and decidability of general first-order logic (with a detour through the guarded fragment)
• Equivalence closure in the two-variable guarded fragment
• Decidability of weak logics with deterministic transitive closure
• scientific article; zbMATH DE number 2086420 (Why is no real title available?)
• Conservative extensions in guarded and two-variable fragments
• The triguarded fragment of first-order logic
• Computer Science Logic
• Querying the guarded fragment with transitivity
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• Computer Science Logic
• STACS 2005
• The triguarded fragment with transitivity

This page was built for publication: Decidability of the Guarded Fragment with the Transitive Closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638100)