scientific article; zbMATH DE number 1304338

MaRDI QIDQ4251069zbMATH OpenFDO

Authors Martin Otto

Publication date 17 June 1999

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)

Recommendations

• scientific article; zbMATH DE number 1954388
• scientific article; zbMATH DE number 3898850
• An automata theoretic decision procedure for the propositional mu- calculus
• Modal μ-Calculus and Alternating Tree Automata

Cited in

(10)

• The descriptive complexity of modal \(\mu\) model-checking games
• Characterizing EF and EX tree logics
• Deciding low levels of tree-automata hierarchy
• A type-directed negation elimination
• scientific article; zbMATH DE number 3898850 (Why is no real title available?)
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
• A gap property of deterministic tree languages.
• scientific article; zbMATH DE number 7104937 (Why is no real title available?)
• Index problems for game automata
• \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)

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)