in this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-lukasiewicz operator. in fact lukasiewicz t-norm is one of the four basic t-norms. a new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

In this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-Lukasiewicz operator. In fact Lukasiewicz t-norm is one of the four basic t-norms. A new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

In 2000, Figallo and Sanza introduced the n×m−valued Lukasiewicz-Moisil algebras, which are a particular case of Matrix Lukasiewicz algebras, and a nontrivial generalization of n−valued Lukasiewicz-Moisil algebras. Here we start a research on the class of n × m−valued Lukasiewicz-Moisil algebras endowed with two modal operators (or 2mLMn×m−algebras). These algebras constitute a common generaliz...

Rough set theory is an important tool for dealing with granularity and vagueness in information systems. This paper studies a kind of rough set algebra. The collection of all the rough sets of an approximation space can be made into a 3-valued Lukasiewicz algebra. We call the algebra a rough 3-valued Lukasiewicz algebra. In this paper, we focus on the rough 3-valued Lukasiewicz algebras, which ...

In this paper we investigate special types of Lukasiewicz filters. We show their connection to crisp filters. Further, we introduce the notion of Lukasiewicz ideal as a set-function which is in some sense complementary to Lukasiewicz filters.

Lukasiewicz implication algebras are the {→, 1}-subreducts of MV algebras. They are the algebraic counterpart of SuperLukasiewicz Implicational Logics. We give a description of free Lukasiewicz implication algebras in the context of McNaughton functions. More precisely, we show that the |X|-free Lukasiewicz implication algebra is isomorphic to ⋃ x∈X [xθ) for a certain congruence θ over the |X|-...

The paper explores properties of the Lukasiewicz μ-calculus, or Lμ for short, an extension of Lukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe that Lμ terms, with n variables, define monotone piecewise linear functions from [0, 1]n to [0, 1]. Two effective procedures for calculating the output of Lμ terms on rational i...

In this paper, we study the finitely many constraints of fuzzy relation inequalities problem and optimize the linear objective function on this region which is defined with fuzzy max-Lukasiewicz operator. In fact Lukasiewicz t-norm is one of the four basic t-norms. A new simplification technique is given to accelerate the resolution of the problem by removing the components having no effect on ...

The Loś-Tarski Theorem and the ChangLoś-Susko Theorem, two classical results in Model Theory, are extended to the infinitevalued Lukasiewicz logic. The latter is used to settle a characterisation of the class of generic structures introduced in the framework of model theoretic forcing for Lukasiewicz logic [1]. Key-words: First Order Many-Valued Logic, Lukasiewicz logic, Model Theory.

In this work we investigate bounded Lukasiewicz logics, characterised as the intersection of the k-valued Lukasiewicz logics for k = 2, . . . , n (n ≥ 2). These logics formalise a generalisation of Ulam’s game with applications in Information Theory. Here we provide an analytic proof calculus G LBn for each bounded Lukasiewicz logic, obtained by adding a single rule to G L, a hypersequent calcu...