  We develop the theory of illfounded and cyclic proof systems in the context
of the modal $\mu$-calculus. A fine analysis of provability and admissibility
bridges the finitary, cyclic and illfounded notions of proof for this logic and
re-enforces the subtlety of two important normal form theorems: guardedness and
disjunctiveness.
