The characterization of (S,N)-implications when N is a non-continuous negation has remained one the most significant open problems in fuzzy logic for last decades. This paper constitutes first progress this topic. Namely, general family implication functions presented, which central property existence completion binary function defined on certain subregion [0,1]2 to t-conorm. In paper, dual pro...

A ring has bounded factorizations if every cancellative nonunit a∈R can be written as a product of atoms and there is bound λ(a) on the lengths such factorizations. The factorization property one most basic finiteness properties in study non-unique Every commutative noetherian domain factorizations, but it open whether result holds noncommutative setting. We provide sufficient conditions for pr...

We investigate the notion of Connes-amenability, introduced by Runde in [14], for bidual algebras and weighted semigroup algebras. We provide some simplifications to the notion of a σWC-virtual diagonal, as introduced in [10], especially in the case of the bidual of an Arens regular Banach algebra. We apply these results to discrete, weighted, weakly cancellative semigroup algebras, showing tha...

the known theory for an oid t shows how to find a subset t of ?t, which is a compact right topological semigroup [i]. the success of the methods in [2] for obtaining properties of-t has prompted us to see how successful they would be in another context. thus we find (theorem 4.8) that t cont ains copies of free semigroups on 2? generators, is an immediate consequence of the stronger result and ...

The known theory for an oid T shows how to find a subset T of ?T, which is a compact right topological semigroup [I]. The success of the methods in [2] for obtaining properties of-T has prompted us to see how successful they would be in another context. Thus we find (Theorem 4.8) that T cont ains copies of free semigroups on 2? generators, is an immediate consequence of the stronger resu...

We study the problem of testing whether a context-free language is included in a fixed set L0, where L0 is the language of words reducing to the empty word in the monoid defined by a complete string rewrite system. We prove that, if the monoid is cancellative, then our inclusion problem is polynomially reducible to the problem of testing equivalence of straight-line programs in the same monoid....