On closed classes of quasilinear functions
On effective presentations of formal concept lattices.
On -fold implicative filters of lattice implication algebras.
On Probability Function On Pseudo-Boolean Algebra
On the construction of dense lattices with a given automorphisms group
We consider the problem of constructing dense lattices in with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions , we exhibit a finite set of lattices that come with an automorphisms group of size , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...
On the number of monotonic functions from two-valued logic to -valued logic
On the Order Type L-valued Relations on L-powersets.
On the representation of S5 algebras and their automorphism groups.