E. A. Emerson and C. S. Jutla, Tree Automata, Mu-Calculus, and Determinacy.
... have somewhat simplied the proofs over
proofs are far from being transparent. Moreover, their
proofs of Theorem (1) and (2) are intertwined. The
new proof of the Complementation Lemma via MuCalculus suggests the following for simplifying the
above approach, i.e. (1) and (2), as well: To ...