1. J.W. Addision, The theory of hierarchies. Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 26–37, Stanford University Press, 1962.
2. A. Arnold and D. Niwiński. Fixed point characterization of Büchi automata on infinite trees. Information Processing and Cybernetics, 8–9:451–459, 1990.
3. A. Arnold and D. Niwiński. Fixed point characterization of weak monadic logic definable sets of trees. In Tree Automata and Languages, pages 159–188, Elsevier, 1992.
4. A. Arnold and D. Niwiński. Rediments of μ-calculus. Elsevier, 2001.
5. A. Arnold and L. Santocanale, On ambiguous classes in the μ-calculus hierarchy of tree languages, Proc. Workshop on Fixed Points in Computer Science, Warsaw, Poland, 2003.