1. Ajtaj M., R. Fagin, and L. Stockmeyer, The closure of Monadic NP, Research report IBM, number RJ10092, 1997.
2. The μ-calculus alternation-depth hierarchy is strict on binary trees;Arnold;RAIRO–Theoretical Informatics and Applications,1999
3. Arnold A., G. Lenzi, and J. Marcinkowski, The hierarchy inside closed monadic Σ1 collapses on the infinite binary tree, accepted at LICS 2001.
4. Bradfield J., The modal mu-calculus alternation hierarchy is strict, in: proc. of CONCUR '96, Lecture Notes in Computer Science 1119, 233–246.
5. Büchi, J. R., On a decision method in restricted second order arithmetic, in: E. Nagel, ed., Logic, Methodology and Philosophy of Science, 1960, 1–11