Dualities associated to binary operations on .
Duality for Cardinal Algebras.
Duality for Hilbert algebras with supremum: An application
We modify slightly the definition of -partial functions given by Celani and Montangie (2012); these partial functions are the morphisms in the category of -space and this category is the dual category of the category with objects the Hilbert algebras with supremum and morphisms, the algebraic homomorphisms. As an application we show that finite pure Hilbert algebras with supremum are determined by the monoid of their endomorphisms.
Dumont's statistic on words.
Edge theorem for finite partially ordered sets
Efficient algorithms on the Moore family associated to an implicational system.
Eine Bemerkung über die -Dimension geordneter Mengen
Eine Bemerkung über Kardinalpotenzen
Eine Bemerkung zum Kardinalprodukt
Einige Charakterisationen von Ketten
Embedding co-continuous posets in function spaces of domains.
Embedding in globals of finite semilattices
Embedding of semilattices into distributive lattices
Embedding partially ordered sets into
We investigate some natural questions about the class of posets which can be embedded into ⟨ω,≤*⟩. Our main tool is a simple ccc forcing notion which generically embeds a given poset E into ⟨ω,≤*⟩ and does this in a “minimal” way (see Theorems 9.1, 10.1, 6.1 and 9.2).
Embeddings into Simple Lattice-ordered Groups with Different First Order Theories.
Embeddings of chains into chains
Continuity of isotone mappings and embeddings of a chain G into another chain are studied. Especially, conditions are found under which the set of points of discontinuity of such a mapping is dense in G.
Endomorphism semigroups of Brouwerian semilattices.
Enveloppe karoubienne de catégories de Kleisli
Équilibre, équivalence, ordre et préordre à distance minimum d'un graphe complet
Les problèmes que nous traitons ici sont en partie familiers aux lecteurs de la revue. L'apport original consiste selon nous dans le fait d'avoir rapproché des problèmes classiques (équilibre d'un graphe, ordre à distance minimum) pour en souligner les analogies profondes et, du coup, plonger de manière féconde ces problèmes dans un ensemble plus large, en particulier en posant le problème de l'équivalence et du préordre à distance minimum d'un graphe complet. Notre exposé se présente donc comme...
Equimorphism invariants for scattered linear orderings
Two linear orderings are equimorphic if they can be embedded in each other. We define invariants for scattered linear orderings which classify them up to equimorphism. Essentially, these invariants are finite sequences of finite trees with ordinal labels. Also, for each ordinal α, we explicitly describe the finite set of minimal scattered equimorphism types of Hausdorff rank α. We compute the invariants of each of these minimal types..