The Alternation Hierarchy for the Theory of mu-lattices
The alternation hierarchy problem asks whether every mu-term,<br />that is a term built up using also a least fixed point constructor<br />as well as a greatest fixed point constructor, is equivalent to a<br />mu-term where the number of nested fixed point of a different type<br />is bounded by a fixed number.<br />In this paper we give a proof that the alternation hierarchy<br />for the theory of mu-lattices is strict, meaning that such number<br />does not exist if mu-terms are built up from the basic lattice <br />operations and are interpreted as expected. The proof relies on the<br />explicit characterization of free mu-lattices by means of games and<br />strategies.
Keyword(s):
2019 ◽
Vol 2
(4)
◽
pp. 245-253
◽
2013 ◽
Vol 2013
◽
pp. 1-14
◽
Keyword(s):
2021 ◽
Vol 118
(12)
◽
pp. e2021244118
Keyword(s):
1965 ◽
Vol 17
◽
pp. 916-922
◽
2011 ◽
pp. 397-402
◽
2019 ◽
Vol 2019
(750)
◽
pp. 1-52