Displaying 21 – 40 of 75

Showing per page

Ultra L I -ideals in lattice implication algebras

Ke Yun Qin, Yang Xu, Young Bae Jun (2002)

Czechoslovak Mathematical Journal

We define an ultra L I -ideal of a lattice implication algebra and give equivalent conditions for an L I -ideal to be ultra. We show that every subset of a lattice implication algebra which has the finite additive property can be extended to an ultra L I -ideal.

Ultra L I -Ideals in lattice implication algebras and M T L -algebras

Xiaohong Zhang, Ke Yun Qin, Wiesław Aleksander Dudek (2007)

Czechoslovak Mathematical Journal

A mistake concerning the ultra L I -ideal of a lattice implication algebra is pointed out, and some new sufficient and necessary conditions for an L I -ideal to be an ultra L I -ideal are given. Moreover, the notion of an L I -ideal is extended to M T L -algebras, the notions of a (prime, ultra, obstinate, Boolean) L I -ideal and an I L I -ideal of an M T L -algebra are introduced, some important examples are given, and the following notions are proved to be equivalent in M T L -algebra: (1) prime proper L I -ideal and Boolean L I -ideal,...

Un algorithme de partition d'un produit direct d'ordres totaux en un nombre minimum de chaînes

Emmanuel Pichon, Philippe Lenca, Fabrice Guillet, Jian Wei Wang (1994)

Mathématiques et Sciences Humaines

Cette étude s'inscrit dans un prolongement algorithmique d'un travail de Bruno Leclerc, publié dans cette revue, qui discute de la taille maximum d'une antichaîne dans un produit direct P d'ordres totaux. On y présente un algorithme de partitionnement de P en un nombre minimum de chaînes. Enfin, on décrit brièvement une application à l'extraction de connaissance.

Currently displaying 21 – 40 of 75