نتایج جستجو برای: stronglycompletely distributive l ordered set
تعداد نتایج: 1287961 فیلتر نتایج به سال:
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered tree pattern with internal structured variables, called a term tree, is a rooted tree pattern which consists of tree structures with ordered children and internal structured variables. A term tree is suited for repre...
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragment of classical propositional logic given by conjunction, disjunction, true, and false. For these logics we define both algebraic semantics, in the form of distributive modal algebras, and relational semantics, in the...
in this paper, tripled coincidence points of mappings satisfying -contractive conditions in the framework of partially ordered gb-metric spaces are obtained. our results extend the results of aydi et al. [h. aydi, e. karapnar and w. shatanawi, tripled xed point results in generalized metric space, j. applied math., volume 2012, article id 314279, 10 pages]. moreover, some examples of the mai...
A locally small category E is totally distributive (as defined by Rosebrugh-Wood) if there exists a string of adjoint functors t ⊣ c ⊣ y, where y : E → Ê is the Yoneda embedding. Saying that E is lex totally distributive if, moreover, the left adjoint t preserves finite limits, we show that the lex totally distributive categories with a small set of generators are exactly the injective Grothend...
Let D be the system of all distributive lattices and let D0 be the system of all L ∈ D such that L possesses the least element. Further, let D1 be the system of all infinitely distributive lattices belonging to D0. In the present paper we investigate the radical classes of the systems D, D0 and D1.
A distributive lattice L with 0 is finitary if every interval is finite. A function f : N0 N0 is a cover function for L if every element with n lower covers has f (n) upper covers. In this paper, all finitary distributive lattices with non-decreasing cover functions are characterized. A 1975 conjecture of Richard P. Stanley is thereby settled. 2000 Academic Press
There are various ways to obtain distributive semilattices from other mathematical objects. Two of them are the following; we refer to Section 1 for more precise definitions. A dimension group is a directed, unperforated partially ordered abelian group with the interpolation property, see also K.R. Goodearl [6]. With a dimension group G we can associate its semilattice of compact ( = finitely g...
In this work we generalize previous constructions of fuzzy set categories, introduced in [5], by considering L-fuzzy sets in which the values of the characteristic functions run on a completely distributive lattice, rather than in the unit real interval. Later, these L-fuzzy sets are used to define the L-fuzzy categories, which are proven to be rational. In the final part of the paper, the L-fu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید