Conjunctively polynomial-like Boolean functions.
Cet article constitue une présentation unifiée des principales méthodes de construction du treillis de Galois d'une correspondance. Nous rappelons d'abord sa définition, puis nous décrivons quatre algorithmes de construction des éléments du treillis qui sont les rectangles maximaux de la relation binaire. Ces algorithmes ne sont pas originaux. Les descriptions précises de algorithmes, le plus souvent absentes des publications originales, permettent une programmation simple, dans un langage procédural...
A method is presented making it possible to construct -groups with a strong theory of quasi-divisors of finite character and with some prescribed properties as subgroups of restricted Hahn groups , where are finitely atomic root systems. Some examples of these constructions are presented.
In this paper, we propose the general methods, yielding uninorms on the bounded lattice , with some additional constraints on for a fixed neutral element based on underlying an arbitrary triangular norm on and an arbitrary triangular conorm on . And, some illustrative examples are added for clarity.
A construction of cell algebras is introduced and some of their properties are investigated. A particular case of this construction for lattices of nets is considered.
This is an expository paper about constructions of locally compact, Hausdorff, scattered spaces whose Cantor-Bendixson height has cardinality greater than their Cantor-Bendixson width.