By a new partial ordering relation “ ≤ ” the set of convex sublattices CS(L) of a lattice L is again a lattice. In this paper we establish some results on the pseudocomplementation of (CS(L); ≤). We show that a lattice L with 0 is dense if and only if CS(L) is dense. Then we prove that a finite distributive lattice is a Stone lattice if and only if CS(L) is Stone. We also prove that an upper co...

In this paper, we discuss the properties of some elements in autometrized algebra. We also introduce normal Furthermore, obtain l-algebras among semialgebras satisfying several conditions and discussing its properties. prove that a semialgebra certain is lattice distributive. Finally, establish an equivalent condition between l-algebra representable algebra with conditions. conditions, there ex...

Let (L, ≤), be an algebraic lattice. It is well-known that (L, ≤) with its topological structure is topologically scattered if and only if (L, ≤) is ordered scattered with respect to its algebraic structure. In this note we prove that, if L is a distributive algebraic lattice in which every element is the infimum of finitely many primes, then L has Krull-dimension if and only if L has derived d...

An element s of an (abstract) algebra A is a single element of A if asb = 0 and a, b ∈ A imply that as = 0 or sb = 0. Let X be a real or complex reflexive Banach space, and let B be a finite atomic Boolean subspace lattice on X, with the property that the vector sum K +L is closed, for every K,L ∈ B. For any subspace lattice D ⊆ B the single elements of Alg D are characterised in terms of a coo...

The concepts of P-compactness, countable P-compactness, the P-Lindelöf property are introduced in L-topological spaces by means of preopen L-sets and their inequalities when L is a complete DeMorgan algebra. These definitions do not rely on the structure of the basis lattice L and no distributivity in L is required. They can also be characterized by means of preclosed L-sets and their inequalit...

Classical results of Birkhoff and of Dilworth yield an extremely useful representation of a finite distributive lattice L as the downset lattice D(JL) of poset JL of join-irreducible elements of L. Through this they get a correspondence between the chain decompositions of JL and the tight embeddings of L into a product of chains. We use a simple but elegant result of Rival which characterizes s...

The aim of the present paper is to define the localisation of MValgebra of an MV-algebra A with respect to a topology F on A. In the last part of the paper it is proved that the maximal MV-algebra of quotients (defined in [6]) and the MV-algebra of fractions relative to an ∧−closed system (defined in [5]) are MV algebra of localisation. The concept of multiplier for distributive lattices was de...

The complexity of a lattice polynomial is defined inductively, with variables having complexity 0. If p=plv'"vOk or p=plA'''/XOk is the canonical expression of the polynomial O, then the complexity c(p) = l+max{c(p~):l<-i-k}. An n-k lattice inclusion is an inclusion of the form p <-o-with c(p)<-n and c(o-)-k. In this note we use the main result of Day [1] to show that if all the congruence latt...

We present a purely domain-theoretic model of Coquand and Huet’s Calculus of Construction [3], which is one of the most powerful type systems proposed in the literature. The well-formed expressions of its language are divided into three levels: Terms, Types, and Orders. Terms are the elements of Types, while the elements of Orders are called Operators. There is a special Order constant Type den...