Since 2014
Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
|
|
| Creator |
Bradfield, Julian C.
|
|
| Description |
We provide an elementary proof of the fixpoint alternationhierarchy 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.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1998-12-23
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19499
10.7146/brics.v5i53.19499 |
|
| Source |
BRICS Report Series; No 53 (1998): RS-53 Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
BRICS Report Series; No 53 (1998): RS-53 Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19499/17121
|
|
| Rights |
Copyright (c) 2014 BRICS Report Series
|
|