Related papers: Completeness for vector lattices
Based on the concept of unbounded absolutely weakly convergence, we give new characterizations of L-weakly compact sets. As applications, we find some properties of order weakly compact operators. Also, a new characterizations of order…
We prove that the universal theory and the quasi-equational theory of bounded residuated distributive lattice-orderegroupoids are both EXPTIME-complete. Similar results areproven for bounded distributive lattices with a unary or binary…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
We introduce the notion of (maximal) multi-truncations on a vector lattice as a generalization of the notion of truncations, an object of recent origin. We obtain a Johnson-Kist type representation of vector lattices with maximal…
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
In this paper we consider second order fully nonlinear operators with an additive superlinear gradient term. Like in the pioneering paper of Brezis for the semilinear case, we obtain the existence of entire viscosity solutions, defined in…
This paper establishes some equivalent conditions of a uninorm, extending an arbitrary triangular norm on [0, e] or an arbitrary triangular conorm on [e, 1] to the whole lattice.
Disjointness, bands, and band projections are a classical and essential part of the structure theory of vector lattices. If $X$ is such a lattice, those notions seem - at first glance - intimately related to the lattice operations on $X$.…
In the context of partially ordered vector spaces one encounters different sorts of order convergence and order topologies. This article will investigate these notions and their relations. In particular we study and relate the order…
A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
We capture in the context of lex colimits, introduced by Garner and Lack, the universal property of the free regular and Barr-exact completions of a weakly lex category. This is done by introducing a notion of flatness for functors…
In this paper we provide sufficient conditions that ensure the existence of the solution of some vector equilibrium problems in Hausdorff topological vector spaces ordered by a cone. The conditions that we consider are imposed not on the…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
A net $(x_\alpha)$ in a Banach lattice $X$ is said to un-converge to a vector $x$ if $\bigl\lVert\lvert x_\alpha-x\rvert\wedge u\bigr\rVert\to 0$ for every $u\in X_+$. In this paper, we investigate un-topology, i.e., the topology that…
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We present two criteria for checking approximate proper efficiency in vector optimization problems with the ordering cone being a nonnegative orthant. Although the criteria can be established by Benson's approach [H.P. Benson, \textit{An…