Abstract reflexive sublattices and completely distributive collapsibility
نویسندگان
چکیده
منابع مشابه
Maximal Sublattices of Nite Distributive Lattices
Algebraic properties of lattices of quotients of nite posets are considered. Using the known duality between the category of all nite posets together with all order-preserving maps and the category of all nite distributive (0; 1)-lattices together with all (0; 1)-lattice ho-momorphisms, algebraic and arithmetic properties of maximal proper sublattices and, in particular, Frattini sublattices of...
متن کاملA duality between fuzzy domains and strongly completely distributive $L$-ordered sets
The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...
متن کامل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...
متن کامل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 ...
متن کاملConditions for Non-confounding and Collapsibility without Knowledge of Completely Constructed Causal Diagrams
In this paper, we discuss several concepts in causal inference in terms of causal diagrams proposed by Pearl (1993, 1995a, b), and we give conditions for non-confounding, homogeneity and collapsibility for causal eects without knowledge of a completely constructed causal diagram. We ®rst introduce the concepts of non-confounding, conditional non-confounding, uniform non-confounding, homogeneit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1998
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700032226