Geodesic
The μ-calculus alternation-depth hierarchy is strict on binary trees
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 329-339

Voir la notice de l'article provenant de la source Numdam

@article{ITA_1999__33_4-5_329_0,
     author = {Arnold, Andr\'e},
     title = {The $\mu $-calculus alternation-depth hierarchy is strict on binary trees},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {329--339},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {4-5},
     year = {1999},
     mrnumber = {1748659},
     zbl = {0945.68118},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1999__33_4-5_329_0/}
}
TY  - JOUR
AU  - Arnold, André
TI  - The $\mu $-calculus alternation-depth hierarchy is strict on binary trees
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
SP  - 329
EP  - 339
VL  - 33
IS  - 4-5
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1999__33_4-5_329_0/
LA  - en
ID  - ITA_1999__33_4-5_329_0
ER  - 
%0 Journal Article
%A Arnold, André
%T The $\mu $-calculus alternation-depth hierarchy is strict on binary trees
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 329-339
%V 33
%N 4-5
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1999__33_4-5_329_0/
%G en
%F ITA_1999__33_4-5_329_0
Arnold, André. The $\mu $-calculus alternation-depth hierarchy is strict on binary trees. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 329-339. http://geodesic.mathdoc.fr/item/ITA_1999__33_4-5_329_0/