Some properties of an ordering relation on certain classes of functors
In this paper, we prove that Eulerian lattices satisfying some weaker conditions for lattices or some weaker conditions for 0-distributive lattices become Boolean.
Axioms are given for positive comparative probabilities and plausibilities defined either on Boolean algebras or on arbitrary sets of events. These axioms allow to characterize binary relations representable by either standard or nonstandard measures (i. e. taking values either on the real field or on a hyperreal field). We also study relations between conditional events induced by preferences on conditional acts.
We introduce statisch pairs in atomistic posets and study its relationships with some known concepts in posets such as biatomic and dual modular pairs, perspectivity and subspaces of atom space of an atomistic poset. We generalize the notion of exchange property in posets and with the help of it we prove the equivalence of dual modular, biatomic and statisch pairs in atomistic posets. Also, we prove that the set of all finite elements of a statisch poset with such property forms an ideal. -relation...
In a former paper, motivated by a recent theory of relators (families of relations), we have investigated increasingly regular and normal functions of one preordered set into another instead of Galois connections and residuated mappings of partially ordered sets. A function of one preordered set into another has been called (1) increasingly -normal, for some function of into , if for any and we have if and only if ; (2) increasingly -regular, for some function of into itself,...
Les produits de chaînes comptent parmi les ensembles (partiellement) ordonnés les plus fréquemment rencontrés. On rappelle, avec des démonstrations en partie nouvelles, divers résultats exacts ou approchés sur les cardinaux de leurs niveaux et sur le nombre de ses niveaux de cardinal maximum. Un plongement avec de bonnes propriétés permet d'appliquer ces résultats aux niveaux du permutoèdre (ordre faible de Bruhat sur les permutations).