Decidability of the Guarded Fragment with the Transitive Closure

DOI10.1007/978-3-642-02930-1_22zbMATH Open1248.03020OpenAlexW1580817032MaRDI QIDQ3638100

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

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

Related Items (4)

Computer Science Logic ⋮ Title not available (Why is that?) ⋮ On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity ⋮ Equivalence closure in the two-variable guarded fragment

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)