文章基本信息

标题：Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
本地全文：下载
作者：Julian C. Bradfield
期刊名称：BRICS Report Series
印刷版ISSN：0909-0878
出版年度：1998
卷号：5
期号：53
出版社：Aarhus University
摘要：We provide an elementary proof of the fixpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mu-calculus alternation hierarchy. We further show that the alternation hierarchy on the binary tree is strict, resolving a problem of Niwinski.