All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 35 Next

Displaying 681 – 700 of 1313

Showing per page

On the decidability of semigroup freeness

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability...

On the decidability of semigroup freeness∗

Julien Cassaigne, Francois Nicolas (2012)

RAIRO - Theoretical Informatics and Applications

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids....

On the direct product of uninorms on bounded lattices

Emel Aşıcı, Radko Mesiar (2021)

Kybernetika

In this paper, we study on the direct product of uninorms on bounded lattices. Also, we define an order induced by uninorms which are a direct product of two uninorms on bounded lattices and properties of introduced order are deeply investigated. Moreover, we obtain some results concerning orders induced by uninorms acting on the unit interval [ 0 , 1 ] .

On the Leibniz congruences

Josep Font (1993)

Banach Center Publications

The aim of this paper is to discuss the motivation for a new general algebraic semantics for deductive systems, to introduce it, and to present an outline of its main features. Some tools from the theory of abstract logics are also introduced, and two classifications of deductive systems are analysed: one is based on the behaviour of the Leibniz congruence (the maximum congruence of a logical matrix) and the other on the behaviour of the Frege operator (which associates to every theory the interderivability...

Currently displaying 681 – 700 of 1313