The Alternation Hierarchy for the Theory of mu-lattices
DOI:
https://doi.org/10.7146/brics.v7i29.20163Resumé
The alternation hierarchy problem asks whether every mu-term,that is a term built up using also 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 point of a different type
is bounded by a fixed number.
In this paper we give a proof that the alternation hierarchy
for the theory of mu-lattices is strict, meaning that such number
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.
Downloads
Publiceret
2000-01-29
Citation/Eksport
Santocanale, L. (2000). The Alternation Hierarchy for the Theory of mu-lattices. BRICS Report Series, 7(29). https://doi.org/10.7146/brics.v7i29.20163
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
