On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic 论文

1996Lecture notes in computer science引用 250
Logic, programming, and type systemsFormal Methods in VerificationLogic, Reasoning, and Knowledge

On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic · 相关文章

暂无数据