The alternation hierarchy for the theory of μ-lattices - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory and Applications of Categories Année : 2002

The alternation hierarchy for the theory of μ-lattices

Luigi Santocanale

Résumé

The alternation hierarchy problem asks whether every μ-term φ, 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 μ-term where the number of nested fixed points of a different type is bounded by a constant independent of φ. In this paper we give a proof that the alternation hierarchy for the theory of μ-lattices is strict, meaning that such a constant does not exist if μ-terms are built up from the basic lattice operations and are interpreted as expected. The proof relies on the explicit characterization of free μ-lattices by means of games and strategies.
Fichier non déposé

Dates et versions

hal-01261116 , version 1 (23-01-2016)

Identifiants

  • HAL Id : hal-01261116 , version 1

Citer

Luigi Santocanale. The alternation hierarchy for the theory of μ-lattices . Theory and Applications of Categories, 2002, A special volume of articles from the CT2000 Conference, 9, pp.166--197. ⟨hal-01261116⟩
19 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More