Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Free mu-lattices

View through CrossRef
A mu-lattice is a lattice with the property that every unary <br />polynomial has both a least and a greatest fix-point. In this paper<br />we define the quasivariety of mu-lattices and, for a given partially<br />ordered set P, we construct a mu-lattice JP whose elements are<br />equivalence classes of games in a preordered class J (P). We prove<br />that the mu-lattice JP is free over the ordered set P and that the<br />order relation of JP is decidable if the order relation of P is <br />decidable. By means of this characterization of free mu-lattices we<br />infer that the class of complete lattices generates the quasivariety<br />of mu-lattices.<br />Keywords: mu-lattices, free mu-lattices, free lattices, bicompletion<br />of categories, models of computation, least and greatest fix-points,<br />mu-calculus, Rabin chain games.
Det Kgl. Bibliotek/Royal Danish Library
Title: Free mu-lattices
Description:
A mu-lattice is a lattice with the property that every unary <br />polynomial has both a least and a greatest fix-point.
In this paper<br />we define the quasivariety of mu-lattices and, for a given partially<br />ordered set P, we construct a mu-lattice JP whose elements are<br />equivalence classes of games in a preordered class J (P).
We prove<br />that the mu-lattice JP is free over the ordered set P and that the<br />order relation of JP is decidable if the order relation of P is <br />decidable.
By means of this characterization of free mu-lattices we<br />infer that the class of complete lattices generates the quasivariety<br />of mu-lattices.
<br />Keywords: mu-lattices, free mu-lattices, free lattices, bicompletion<br />of categories, models of computation, least and greatest fix-points,<br />mu-calculus, Rabin chain games.

Related Results

Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
<div>Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajt...
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
<div>Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajt...
Unbounded Star Convergence in Lattices
Unbounded Star Convergence in Lattices
Let L be a vector lattice, "(" x_α ") " be a L-valued net, and x∈L . If |x_α-x|∧u→┴o 0 for every u ∈〖 L〗_+ then it is said that the net "(" x_α ")" unbounded order converges ...
COUPLING OSCILLATIONS OF LATTICES OF DIFFERENT DIELECTRIC RESONATORS
COUPLING OSCILLATIONS OF LATTICES OF DIFFERENT DIELECTRIC RESONATORS
Background. The development of many elements of modern communication systems is increasingly based on the use of various types of dielectric resonators (DR). The theory of coupled ...
Ambiguities in powder pattern indexing: A ternary lattice metric singularity
Ambiguities in powder pattern indexing: A ternary lattice metric singularity
A lattice metric singularity occurs when unit cells defining two (or more) lattices yield the identical set of unique calculated d-spacings. The existence of such singularities, th...
On Weakly Associative Lattices and Near Lattices
On Weakly Associative Lattices and Near Lattices
Summary. The main aim of this article is to introduce formally two generalizations of lattices, namely weakly associative lattices and near lattices, which can be obtained from the...
Ground state topological properties of ultracold atoms in composite scalar-Raman optical lattices
Ground state topological properties of ultracold atoms in composite scalar-Raman optical lattices
The ground-state topological properties of ultracold atoms in composite scalar-Raman optical lattices are systematically investigated by solving the two-component Gross-Pitaevskii ...

Back to Top