Free mu-lattices
DOI:
https://doi.org/10.7146/brics.v7i28.20161Resumé
A mu-lattice is a lattice with the property that every unarypolynomial has both a least and a greatest fix-point. In this paper
we define the quasivariety of mu-lattices and, for a given partially
ordered set P, we construct a mu-lattice JP whose elements are
equivalence classes of games in a preordered class J (P). We prove
that the mu-lattice JP is free over the ordered set P and that the
order relation of JP is decidable if the order relation of P is
decidable. By means of this characterization of free mu-lattices we
infer that the class of complete lattices generates the quasivariety
of mu-lattices.
Keywords: mu-lattices, free mu-lattices, free lattices, bicompletion
of categories, models of computation, least and greatest fix-points,
mu-calculus, Rabin chain games.
Downloads
Publiceret
2000-10-28
Citation/Eksport
Santocanale, L. (2000). Free mu-lattices. BRICS Report Series, 7(28). https://doi.org/10.7146/brics.v7i28.20161
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).
