Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
437586 | Theoretical Computer Science | 2010 | 18 Pages |
Abstract
We prove that the modal μ-calculus collapses to first order logic over the class of finite transitive frames. The proof is obtained by using some byproducts of a new proof of the collapse of the μ-calculus to the alternation free fragment over the class of transitive frames.Moreover, we prove that the modal μ-calculus is Büchi and co-Büchi definable over the class of all models where, in a strongly connected component, vertexes are distinguishable by means of the propositions they satisfy.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics