Related papers: Quasicomplemented residuated lattices
Suppose that lambda is the successor of a singular cardinal mu whose cofinality is an uncountable cardinal kappa. We give a sufficient condition that the club filter of lambda concentrating on the points of cofinality kappa is not…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
A nucleus $\gamma$ on a (bounded commutative integral) residuated lattice $\mathbf{A}$ is a closure operator that satisfies the inequality $\gamma(a) \cdot \gamma(b) \leq \gamma(a \cdot b)$ for all $a,b \in A$. In this article, among…
We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…
We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…
The context of this work is that of partial frames; these are meet-semilattices where not all subsets need have joins. A selection function, S, specifies, for all meet-semilattices, certain subsets under consideration, which we call the…
We introduce a system combining the quadratic self-attractive or composite quadratic-cubic nonlinearity, acting in the combination with the fractional diffraction, which is characterized by its L\'{e}vy index $\alpha $. The model applies to…
When an algebraic logic based on a poset instead of a lattice is investigated then there is a natural problem how to introduce the connective implication to be everywhere defined and satisfying (left) adjointness with the connective…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
Residual finiteness is known to be an important property of groups appearing in combinatorial group theory and low dimensional topology. In a recent work [2] residual finiteness of quandles was introduced, and it was proved that free…
This paper investigates the intersection of residuated structures from many-valued logic and orthomodular lattices from quantum logic. We explore whether non-Boolean structures can simultaneously satisfy residuation principles and…
One-dimensional quasilattices are classified into mutual local-derivability (MLD) classes on the basis of geometrical and number-theoretical considerations. Most quasilattices are ternary, and there exist an infinite number of MLD classes.…
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
We review recent progress in understanding the notion of locality in integrable quantum lattice systems. The central concept are the so-called quasilocal conserved quantities, which go beyond the standard perception of locality. Two…
We say that a finite dimensional Lie algebra is quasi-reductive if it has a linear form whose stabilizer for the coadjoint representation, modulo the center, is a reductive Lie algebra with a center consisting of semisimple elements.…
We analyse nonlinear wave propagation and cascaded self-focusing due to second-harmonic generation in Fibbonacci optical superlattices and introduce a novel concept of nonlinear physics, the quasiperiodic soliton, which describes spatially…
We construct a quasi-particle basis of the integrable highest weight module of highest weight $3\Lambda_0$ for the twisted affine Lie algebra of type $A_2^{(2)}$ in the principal realization. More specifically, by introducing the concept of…
Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…
A planar (upper) semimodular lattice $L$ is slim if the five-element nondistributive modular lattice $M_3$ does not occur among its sublattices. (Planar lattices are finite by definition.) Slim rectangular lattices as particular slim planar…
Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The…