Related papers: Unbounded Order Convergence and Universal Completi…
In this work we investigate the transfer of fundamental order and completeness properties between truncated Riesz spaces and their unitizations. Specifically, we provide characterizations and equivalences for several notions of…
We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy tolerances on fuzzy complete lattices and prove they are in…
In this paper, we study the congruences, prime filters and prime ideals of horizontal sums of bounded lattices, then, through a construction based on horizontal sums and without enforcing the Continuum Hypothesis, we are modifying an…
We investigate in which cases the boundary of a multiply connected wandering domain of an entire function is uniformly perfect. We give a general criterion implying that it is not uniformly perfect. This criterion applies in particular to…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
The Finiteness Problem is shown to be unsolvable for any sufficiently large class of modular lattices.
We construct convergent and divergent lattices in negative curvature and give a precise asymptotic description of the behavior of their counting function.
This note is a follow-up to \cite{bt}. We focus on conditions under which a normed lattice $X$ is majorizing in its norm completion. We show that \cite[Question 8.17]{bt} -- namely, whether this holds whenever every norm-null sequence in…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…
We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…
An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.
Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…
Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…
We consider a constrained optimization problem arising from the study of the Helmholtz equation in unbounded domains. The optimization problem provides an approximation of the solution in a bounded computational domain. In this paper we…
The principle result of this article is the determination of the possible finite subgroups of arithmetic lattices in U(2,1).
Different notions for order convergence have been considered by various authors. Associated to every notion of order convergence corresponds a topology, defined by taking as the closed sets those subsets of the poset satisfying that no net…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.