نتایج جستجو برای: lattice complete under a metric

تعداد نتایج: 13701063  

B. Ahmadi Kakavandi M. Amini,

Hadamard (or complete $CAT(0)$) spaces are complete, non-positive curvature, metric spaces. Here, we prove a nonlinear ergodic theorem for continuous non-expansive semigroup in these spaces as well as a strong convergence theorem for the commutative case. Our results extend the standard non-linear ergodic theorems for non-expansive maps on real Hilbert spaces, to non-expansive maps on Ha...

In this paper, we have focused to study convex $L$-subgroups of an $L$-ordered group. First, we introduce the concept of a convex $L$-subgroup and a convex $L$-lattice subgroup of an $L$-ordered group and give some examples. Then we find some properties and use them to construct convex $L$-subgroup generated by a subset $S$ of an $L$-ordered group $G$ . Also, we generalize a well known result a...

2008
P. Cordero

In this work we prove that the set of congruences on an nd-groupoid under suitable conditions is a complete lattice which is a sublattice of the lattice of equivalence relations on the nd-groupoid. The study of these conditions allowed to construct a counterexample to the statement that the set of (fuzzy) congruences on a hypergroupoid is a complete lattice.

Journal: :Bulletin of the American Mathematical Society 1943

Journal: :Topology and its Applications 2003

Journal: :Bulletin of the American Mathematical Society 1969

The main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. In this paper, the notion of  dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. Also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...

2011
Stefan Borgwardt Rafael Peñaloza

We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and PSpace-complete w.r.t. acyclic TBoxes. This matches the known complexity bounds for reasoning in crisp ALCI.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید