Über darstellungen von Verbänden mit -Idealen gerichteter Gruppen
Über das Zutreffen einer Eigenschaft einer Menge auf die Elemente der Potenzmenge
Über Erweiterungen geordneter Mengen
Über Homomorphismen der Kontexte
Über Mengen mit Trennrelationen
Über Realisierungen geordneter Mengen
Un algorithme de partition d'un produit direct d'ordres totaux en un nombre minimum de chaînes
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.
Un modèle des jugements de similitude
Una nota sulla nozione di molto maggiore
Unbouded descending infinite chain in Rudin-Frolík order
Une opérade anticyclique sur les arbustes
We define new combinatorial objects, called shrubs, such that forests of rooted trees are shrubs. We then introduce a structure of operad on shrubs. We show that this operad is contained in the Zinbiel operad, by using the inclusion of Zinbiel in the operad of moulds. We also prove that this inclusion is compatible with the richer structure of anticyclic operad that exists on Zinbiel and on moulds.
Une remarque sur l'algorithme de Ducamp pour la recherche de tous les ordres totaux contenant un ordre partiel
Uniform ideal completions
Universal and internal properties of some completions of k-join-semilattices and k-join-distributive partially ordered sets.
Universal and internal properties of some extensions of partially orderd sets.
Universal cyclically ordered sets
Universality of separoids
A separoid is a symmetric relation defined on disjoint pairs of subsets of a given set such that it is closed as a filter in the canonical partial order induced by the inclusion (i.e., and ). We introduce the notion of homomorphism as a map which preserve the so-called “minimal Radon partitions” and show that separoids, endowed with these maps, admits an embedding from the category of all finite graphs. This proves that separoids constitute a countable universal partial order. Furthermore,...
Upper and Lower Bounds in Relator Spaces
2000 Mathematics Subject Classification: 06A06, 54E15An ordered pair X(R) = ( X, R ) consisting of a nonvoid set X and a nonvoid family R of binary relations on X is called a relator space. Relator spaces are straightforward generalizations not only of uniform spaces, but also of ordered sets. Therefore, in a relator space we can naturally define not only some topological notions, but also some order theoretic ones. It turns out that these two, apparently quite different, types of notions are closely...