Polarity in a completely distributive complete lattice
نویسندگان
چکیده
منابع مشابه
A Subdirect-union Representation for Completely Distributive Complete Lattices
4. Proof of Theorem 2. Harish-Chandra [l] and others have proved that every Lie algebra over a field of characteristic zero has a faithful representation. Consequently by Lemma 4, 8 has a faithful representation x—*Qx whose matrices have elements in an algebraic extension $ of g such that t(QxQv) =0 for all x of 31 and all y of 8. We now apply another form of Cartan's criterion for solvability ...
متن کاملOn lattice-valued frames: The completely distributive case
We provide an extension of the notion of chain-valued frame introduced by Pultr and Rodabaugh in [Category theoretic aspects of chain-valued frames: parts I and II, Fuzzy Sets and Systems 159 (2008) 501–528 and 529–558] by relaxing the assumption that L be a complete chain. As a result of this investigation we formulate the category L-Frm of L-frames under the weaker assumption that L is a comp...
متن کاملTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
متن کاملThe Completely Distributive Lattice of Machine Invariant Sets of Infinite Words
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. The length and width of it is c. We show the subword complexity and the growth function create machine invariant classes.
متن کاملDistributive Lattice-Structured Ontologies
In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attribution operations that preserve ∨, ∧ and ⊥. The preservation of ∧ allows the attributes to model the natural join operation in databases. We start by introducing ontological frameworks and knowledge bases and define the notion ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1988-0943048-5