Related papers: Unbounded Order Convergence and Universal Completi…
We study completions of Archimedean vector lattices relative to any nonempty set of positively-homogeneous functions on finite-dimensional real vector spaces. Examples of such completions include square mean closed and geometric closed…
In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…
In this work, we focus on the set-theoretical solutions of the Yang-Baxter equation which are of finite order and not necessarily bijective. We use the matched product of solutions as a unifying tool for treating these solutions of finite…
Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…
In the paper, we revisit several approaches to the concept of uniform completion $X^{\mathrm{ru}}$ of a vector lattice $X$. We show that many of these approaches yield the same result. In particular, if $X$ is a sublattice of a uniformly…
Let $E$ be a sublattice of a vector lattice $F$. $\left( x_\alpha \right)\subseteq E$ is said to be $ F $-order convergent to a vector $ x $ (in symbols $ x_\alpha \xrightarrow{Fo} x $), whenever there exists another net $…
While there is a well developed theory of locally solid topologies, many important convergences in vector lattice theory are not topological. Yet they share many properties with locally solid topologies. Building upon the theory of…
A recent result of G. Cz\'edli relates the ordered set of principal congruences of a bounded lattice $L$ with the ordered set of principal congruences of a~bounded sublattice $K$ of $L$. In this note, I sketch a new proof.
Using the well-known recognition and structural theorem(s) for root-graded Lie algebras and their universal coverings, we give a finite presentation for the universal covering algebra of a centerless Lie torus of type $X\not=A,C,BC$. We…
Recently, the different types of unbounded convergences (uo, un, uaw, uaw*) in Banach lattices were studied. In this paper, we study the continuous functionals with respect to unbounded convergences. We first characterize the continuity of…
The main aim of the present note is to consider bounded orthomorphisms between locally solid vector lattices. We establish a version of the remarkable Zannen theorem regarding equivalence between orthomomorphisms and the underlying vector…
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
We prove that a tolerance relation of a lattice is a homomorphic image of a congruence relation.
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…
The statistically unbounded $p$-convergence is an abstraction of the statistical order, unbounded order, and $p$-convergences. We investigate the concept of the statistically unbounded convergence on lattice-normed Riesz spaces with respect…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…