mu -definable sets of integers
Robert S. Lubarsky · 2003
The mu -calculus is a language consisting of standard first-order finitary logic with a least fixed-point operator applicable to positive inductive definitions. The main theorem of this study is a set-theoretic characterization of the sets of integers definable in the mu -calculus. Another theorem used but not proved is a prenex normal form theorem for the mu -calculus.>