scientific article; zbMATH DE number 2086420

MaRDI QIDQ4736875zbMATH OpenFDO

Authors Emanuel Kieroński

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850608.htm

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The guarded fragment with transitive guards
• On the complexity of the two-variable guarded fragment with transitive guards
• Querying the guarded fragment with transitivity
• Decidability of the Guarded Fragment with the Transitive Closure
• On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• Computer Science Logic
• scientific article; zbMATH DE number 1956520
• Automated Reasoning

Cited in

(11)

• The guarded fragment with transitive guards
• Equivalence closure in the two-variable guarded fragment
• Decidability of the Guarded Fragment with the Transitive Closure
• scientific article; zbMATH DE number 1950259 (Why is no real title available?)
• scientific article; zbMATH DE number 1956520 (Why is no real title available?)
• Complexity of two-variable logic on finite trees
• On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
• Computer Science Logic
• Complexity of hybrid logics over transitive frames
• On the complexity of the two-variable guarded fragment with transitive guards
• On the freeze quantifier in Constraint LTL: Decidability and complexity

This page was built for publication:

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