An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees

DOI10.1007/978-3-642-12032-9_12zbMath1284.03213OpenAlexW1896053542MaRDI QIDQ3557849

Gaëlle Fontaine, Balder ten Cate

Publication date: 27 April 2010

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12032-9_12

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (4)

Changing a Semantics: Opportunism or Courage? ⋮ Sahlqvist theorem for modal fixed point logic ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees