Finitary ideals of direct products in quantales

The notion of quantale, which designates a complete lattice equipped with an associative binary multiplication distributing over arbitrary joins, appears in various areasof mathematics-in quantaloid theory, in non classical logic as completion of the Lindebaum algebra, and in different representations of the spectrum of a C∗ algebra asmany-valued and non commutative topologies. To put it briefly, its importance is nolonger to be demonstrated. Quantales are ring-like structures in that they share withrings the common fact that while as rings are semi groups in the tensor category ofabelian groups, so quantales are semi groups in the tensor category of sup-lattices.In 2008 Anderson and Kintzinger [1] investigated the ideals, prime ideals, radical ideals, primary ideals, and maximal of a product ring R × S of two commutativenon non necceray unital rings R and S: Something resembling rings are quantales byanalogy with what is studied in ring, we begin an investigation on ideals of a productof two quantales. In this paper, given two quantales Q1 and Q2; not necessarily withidentity, we investigate the ideals, prime ideals, primary ideals, and maximal ideals ofthe quantale Q1 × Q2

Rings with Boolean Lattices of One-Sided Annihilators

The present paper is part of the research on the description of rings with a given property of the lattice of left (right) annihilators. The anti-isomorphism of lattices of left and right annihilators in any ring gives some kind of symmetry: the lattice of left annihilators is Boolean (complemented, distributive) if and only if the lattice of right annihilators is such. This allows us to restrict our investigations mainly to the left side. For a unital associative ring R, we prove that the lattice of left annihilators in R is Boolean if and only if R is a reduced ring. We also prove that the lattice of left annihilators of R being two-sided ideals is complemented if and only if this lattice is Boolean. The last statement, in turn, is known to be equivalent to the semiprimeness of R. On the other hand, for any complete lattice L, we construct a nilpotent ring whose lattice of left annihilators coincides with its sublattice of left annihilators being two-sided ideals and is isomorphic to L. This construction shows that the assumption of R being unital cannot be dropped in any of the above two results. Some additional results on rings with distributive or complemented lattices of left annihilators are obtained.

Congruences on glrac semigroups (I)

The theory of congruences on semigroups is an important part in the theory of semigroups. The aim of this paper is to study [Formula: see text]-congruences on a glrac semigroup. It is proved that the [Formula: see text]-congruences on a glrac semigroup become a complete sublattice of its lattice of congruences. Especially, the structures of left restriction semigroup [Formula: see text]-congruences and the projection-separating [Formula: see text]-congruences on a glrac semigroup are established. Also, we demonstrate that they are both complete sublattice of [Formula: see text]-congruences and consider their relations with respect to complete lattice homomorphism.

L -Fuzzy Prime Spectrums of ADLs

The notion of an Almost Distributive Lattice (ADL) is a common abstraction of several lattice theoretic and ring theoretic generalizations of Boolean algebra and Boolean rings. In this paper, the set of all L -fuzzy prime ideals of an ADL with truth values in a complete lattice L satisfying the infinite meet distributive law is topologized and the resulting space is discussed.

L-Fuzzy Congruences and L-Fuzzy Kernel Ideals in Ockham Algebras

In this paper, we study fuzzy congruence relations and kernel fuzzy ideals of an Ockham algebra A , f , whose truth values are in a complete lattice satisfying the infinite meet distributive law. Some equivalent conditions are derived for a fuzzy ideal of an Ockham algebra A to become a fuzzy kernel ideal. We also obtain the smallest (respectively, the largest) fuzzy congruence on A having a given fuzzy ideal as its kernel.

The Lattice Structures of Approximation Operators Based on L-Fuzzy Generalized Neighborhood Systems

Following the idea of L -fuzzy generalized neighborhood systems as introduced by Zhao et al., we will give the join-complete lattice structures of lower and upper approximation operators based on L -fuzzy generalized neighborhood systems. In particular, as special approximation operators based on L -fuzzy generalized neighborhood systems, we will give the complete lattice structures of lower and upper approximation operators based on L -fuzzy relations. Furthermore, if L satisfies the double negative law, then there exists an order isomorphic mapping between upper and lower approximation operators based on L -fuzzy generalized neighborhood systems; when L -fuzzy generalized neighborhood system is serial, reflexive, and transitive, there still exists an order isomorphic mapping between upper and lower approximation operators, respectively, and both lower and upper approximation operators based on L -fuzzy relations are complete lattice isomorphism.

Induced L-bornological vector spaces and L-Mackey convergence1

Motivated by the concept of lattice-bornological vector spaces of J. Paseka, S. Solovyov and M. Stehlík, which extends bornological vector spaces to the fuzzy setting over a complete lattice, this paper continues to study the theory of L-bornological vector spaces. The specific description of L-bornological vector spaces is presented, some properties of Lowen functors between the category of bornological vector spaces and the category of L-bornological vector spaces are discussed. In addition, the notions and some properties of L-Mackey convergence and separation in L-bornological vector spaces are showed. The equivalent characterization of separation in L-bornological vector spaces in terms of L-Mackey convergence is obtained in particular.

Modeling Imprecise and Bipolar Algebraic and Topological Relations using Morphological Dilations

In many domains of information processing, such as knowledge representation, preference modeling, argumentation, multi-criteria decision analysis, spatial reasoning, both vagueness, or imprecision, and bipolarity, encompassing positive and negative parts of information, are core features of the information to be modeled and processed. This led to the development of the concept of bipolar fuzzy sets, and of associated models and tools, such as fusion and aggregation, similarity and distances, mathematical morphology. Here we propose to extend these tools by defining algebraic and topological relations between bipolar fuzzy sets, including intersection, inclusion, adjacency and RCC relations widely used in mereotopology, based on bipolar connectives (in a logical sense) and on mathematical morphology operators. These definitions are shown to have the desired properties and to be consistent with existing definitions on sets and fuzzy sets, while providing an additional bipolar feature. The proposed relations can be used for instance for preference modeling or spatial reasoning. They apply more generally to any type of functions taking values in a poset or a complete lattice, such as L-fuzzy sets.

Fixpoint Theory – Upside Down

Knaster-Tarski’s theorem, characterising the greatest fix- point of a monotone function over a complete lattice as the largest post-fixpoint, naturally leads to the so-called coinduction proof principle for showing that some element is below the greatest fixpoint (e.g., for providing bisimilarity witnesses). The dual principle, used for showing that an element is above the least fixpoint, is related to inductive invariants. In this paper we provide proof rules which are similar in spirit but for showing that an element is above the greatest fixpoint or, dually, below the least fixpoint. The theory is developed for non-expansive monotone functions on suitable lattices of the form $$\mathbb {M}^Y$$ M Y , where Y is a finite set and $$\mathbb {M}$$ M an MV-algebra, and it is based on the construction of (finitary) approximations of the original functions. We show that our theory applies to a wide range of examples, including termination probabilities, behavioural distances for probabilistic automata and bisimilarity. Moreover it allows us to determine original algorithms for solving simple stochastic games.