scientific article; zbMATH DE number 1696780

MaRDI QIDQ2767035zbMATH OpenFDO

Authors Jean-Marc Talbot

Publication date 22 July 2002

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Formal languages and automata (68Q45)

Recommendations

• The Complexity of Tree Automata and Logics of Programs
• Modal μ-Calculus and Alternating Tree Automata
• A decision procedure for alternation-free modal -calculi
• scientific article; zbMATH DE number 2038748
• A characterization theorem for the alternation-free fragment of the modal -calculus

Cited in

(5)

• A focus system for the alternation-free \(\mu \)-calculus
• Extending co-logic programs for branching-time model checking
• scientific article; zbMATH DE number 1954388 (Why is no real title available?)
• scientific article; zbMATH DE number 956830 (Why is no real title available?)
• The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames

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