The alternation hierarchy for the theory of $\mu$-lattices
Theory and Applications of Categories [electronic only]
, CT2000, Tome 9 (2000), pp. 166-197.
Voir la notice de l'article dans Theory and Applications of Categories website
The alternation hierarchy problem asks whether every $\mu$-term
$\phi$, that is, a term built up also using a least fixed point
constructor as well as a greatest fixed point constructor, is
equivalent to a $\mu$-term where the number of nested fixed points of
a different type is bounded by a constant independent of $\phi$.
In this paper we give a proof that the alternation hierarchy for the
theory of $\mu$-lattices is strict, meaning that such a constant does
not exist if $\mu$-terms are built up from the basic lattice
operations and are interpreted as expected. The proof relies on the
explicit characterization of free $\mu$-lattices by means of games and
strategies.
Classification :
03D55, 06B25, 91A43.
Mots-clés : free lattices, free �-lattices, fixed points, parity games.
Mots-clés : free lattices, free �-lattices, fixed points, parity games.
@article{TAC_2000__9_a8, author = {Luigi Santocanale}, title = {The alternation hierarchy for the theory of $\mu$-lattices}, journal = {Theory and Applications of Categories [electronic only] }, pages = {166--197}, volume = {9}, year = {2000}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/TAC_2000__9_a8/} }
Luigi Santocanale. The alternation hierarchy for the theory of $\mu$-lattices. Theory and Applications of Categories [electronic only] , CT2000, Tome 9 (2000), pp. 166-197. https://geodesic-test.mathdoc.fr/item/TAC_2000__9_a8/