In this paper, using pre-semi-open L-sets and their inequality, a new notion of PS-compactness is introduced in L-topological spaces, where L is a complete De Morgan algebra. This notion does not depend on the structure of the basis lattice L and L does not need any distributivity.

In this paper, for a complete lattice L, we introduce interval-valued L-fuzzy ideal (prime ideal) of a near-ring which is an extended notion of fuzzy ideal (prime ideal) of a near-ring. Some characterization and properties are discussed.

structure of alpha lattice designs makes removing the effects of incomplete blocks from residual effect of plots, and maximizes precision of comparison between genotypes at the same incomplete block. this investigation was conducted to study the international chickpea germplasm, for finding desirable lines regarding seed yield and other traits. two trials including cien-la-2010 and cien-s-2010 ...

For any ordered set P, the join dense completions of P form a complete lattice K(P) with least element O(P), the lattice of order ideals of P, and greatest element M(P), the Dedekind-MacNeille completion of P. The latticeK(P) is isomorphic to an ideal of the lattice of all closure operators on the lattice O(P). Thus it inherits some local structural properties which hold in the lattice of closu...

With L a complete lattice and M a continuous lattice, this paper demonstrates an adjunction between M-valued L-topological spaces (i.e. (L,M)-topological spaces) and Idl(M)-valued L-topological spaces where Idl(M) is the complete lattice of all ideals of M. It is shown that the right adjoint functor provides a procedure of generating (L,M)-topologies from antitone families of (L,M)-topologies. ...

In this abstract, we present complete-lattice data ow analysis frameworks. These are a generalization of semi-lattice based data ow analysis frameworks and are designed to support the description and solution of data ow analysis problems over ow graphs for concurrent programs. We describe the limitations of existing data ow frameworks as applied to concurrent programs; these limitations are add...

Dragan Mašulović Abstract. One can turn the set of retractions of a lattice 〈L,≤〉 into a poset Rf (L) by letting f ≤ g iff f(x) ≤ g(x) for all x ∈ L. In 1982 H. Crapo raised the following two problems: (1) Is it true that Rf (L) is a lattice for any lattice L? (2) Is it true that Rf (L) is a complete lattice if L is a complete lattice? In 1990 and 1991 B. Li published two papers dealing with th...

The free distributive completion of a partial complete lattice is the complete lattice that it is freely generated by the partial complete latticèin the most distributive way'. This can be described as being a universal solution in the sense of universal algebra. Free distributive completions generalize the constructions of tensor products and of free completely distributive complete lattices o...