scientific article; zbMATH DE number 1956520

MaRDI QIDQ4417866zbMATH OpenFDO

Authors Emanuel Kieroński

Publication date 30 July 2003

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) 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

• On the complexity of the two-variable guarded fragment with transitive guards
• scientific article; zbMATH DE number 2086420
• The guarded fragment with transitive guards
• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• Computer Science Logic

Cited in

(10)

• The guarded fragment with transitive guards
• A general method for proving decidability of intuitionistic modal logics
• Deciding regular grammar logics with converse through first-order logic
• On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• scientific article; zbMATH DE number 2086420 (Why is no real title available?)
• Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
• STACS 2005
• Complexity of hybrid logics over transitive frames
• On the complexity of the two-variable guarded fragment with transitive guards

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 Q4417866)