Treffer: An Approximation Semantics for the Propositional Mu-Calculus.
Title:
An Approximation Semantics for the Propositional Mu-Calculus.
Authors:
Goos, Gerhard1, Hartmanis, Juris2, van Leeuwen, Jan3, Diks, Krzysztof4 diks@mimuw.edu.pl, Rytter, Wojciech4,5 rytter@mimuw.edu.pl, Villemaire, Roger6 villemaire.roger@uqam.ca
Source:
Mathematical Foundations of Computer Science 2002. 2002, p637-649. 13p.
Database:
Supplemental Index
Weitere Informationen
We give a new semantics for the propositional μ-calculus, prove that it is equivalent to the standard semantics and use it in order to propose a constraint based axiomatization of the μ-calculus. We show that our axiomatization is sound relatively to our semantics. Completeness of the system is the topic of ongoing research but we give a simple example of how our system could be used to construct a finite counter-example of an unprovable sentence. [ABSTRACT FROM AUTHOR]