EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
03-XX Mathematical logic and foundations
03Dxx Computability and recursion theory
03D80 Applications of computability and recursion theory

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 2 of 2

Fixpoint alternation : arithmetic, transition systems, and the binary tree

J. C. Bradfield (1999)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Fixpoint alternation: arithmetic, transition systems, and the binary tree

J. C. Bradfield (2010)

RAIRO - Theoretical Informatics and Applications

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 Niwiński.

Currently displaying 1 – 2 of 2

Page 1