scientific article; zbMATH DE number 1304338

zbMATH Open0924.03029MaRDI QIDQ4251069FDOQ4251069

Martin Otto

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

decidabilitymodal logictree automatamodal \(\mu\)-calculusexponential time decision proceduremonadic second-order theory of the complete binary tree

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (8)

• Title not available (Why is that?)
• Index Problems for Game Automata
• \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
• Title not available (Why is that?)
• A gap property of deterministic tree languages.
• Characterizing EF and EX tree logics
• Title not available (Why is that?)
• Deciding low levels of tree-automata hierarchy

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An automata theoretic decision procedure for the propositional mu- calculus 👍 👎
• Modal μ-Calculus and Alternating Tree Automata 👍 👎

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