We present a systematic study of join-extensions and join-completions of ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from properties of the Dedekind-MacNeille completion to the proof of the finite embeddability property for a number of varieties of ordered algebras
We investigate ways of representing ordered sets as algebras and how the order relation is reflected...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
AbstractThis paper investigates completions in the context of finitely generated lattice-based varie...
We present a systematic study of join-extensions and join-completions of ordered algebras, which na...
Summary. Ordered algebraic structures are encountered in many areas of math-ematics. One frequently ...
AbstractAn abstract characterization of some constructions relating to ordered and complete algebras...
An algebra A = 〈A;F 〉 is a distributive lattice expansion if there are terms ∧, ∨ ∈ TerA, the term ...
AbstractExtended-order algebras are defined, whose operation extends the order relation of a poset w...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
We prove the following theorem. Theorem Let(P,≦)be an arbitrary partially ordered structure. Then, t...
This paper investigates profinite completions of residually finite algebras, drawing on ideas from t...
Abstract. If/C is a variety of orthomodular l ttices generated by a set of orthomodular l ttices hav...
Abstract. The study of sup lattices teaches us the important distinction between the algebraic part ...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
We apply the well known equivalence between meet-completions of posets and standard closure operator...
We investigate ways of representing ordered sets as algebras and how the order relation is reflected...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
AbstractThis paper investigates completions in the context of finitely generated lattice-based varie...
We present a systematic study of join-extensions and join-completions of ordered algebras, which na...
Summary. Ordered algebraic structures are encountered in many areas of math-ematics. One frequently ...
AbstractAn abstract characterization of some constructions relating to ordered and complete algebras...
An algebra A = 〈A;F 〉 is a distributive lattice expansion if there are terms ∧, ∨ ∈ TerA, the term ...
AbstractExtended-order algebras are defined, whose operation extends the order relation of a poset w...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
We prove the following theorem. Theorem Let(P,≦)be an arbitrary partially ordered structure. Then, t...
This paper investigates profinite completions of residually finite algebras, drawing on ideas from t...
Abstract. If/C is a variety of orthomodular l ttices generated by a set of orthomodular l ttices hav...
Abstract. The study of sup lattices teaches us the important distinction between the algebraic part ...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
We apply the well known equivalence between meet-completions of posets and standard closure operator...
We investigate ways of representing ordered sets as algebras and how the order relation is reflected...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
AbstractThis paper investigates completions in the context of finitely generated lattice-based varie...