Frame Definability for Classes of Trees in the μ-calculus

DOI10.1007/978-3-642-15155-2_34MaRDI QIDQ3586099zbMATH OpenOpenAlexFDO

Authors Gaëlle Fontaine, Thomas Place

Publication date 3 September 2010

Published in Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15155-2_34

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• An initial semantics for the -calculus on trees and Rabin's complementation lemma
• scientific article; zbMATH DE number 475247
• Sequent Calculus in the Topos of Trees
• The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames
• scientific article; zbMATH DE number 1795230
• scientific article; zbMATH DE number 475417
• An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
• Frame definability in finitely valued modal logics
• Definable operations on weakly recognizable sets of trees
• On computing the measures of first-order definable sets of trees

Cited in

(4)

• scientific article; zbMATH DE number 5270689 (Why is no real title available?)
• scientific article; zbMATH DE number 4187792 (Why is no real title available?)
• On the \(\mu \)-calculus over transitive and finite transitive frames
• The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames

This page was built for publication: Frame Definability for Classes of Trees in the μ-calculus

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