extending fuzzy logics with many hedges abstract fuzzy logic aims at modeling logical reasoning with vague or imprecise statements which may contain linguistic hedges in fact many hedges e g very highly rather and slightly can be used simultaneously to express different levels of emphasis moreover each hedge might have a dual one e g slightly can be seen as a dual hedge of very thus it is necessary to extend systems of fuzzy logic with multiple hedges this work proposes two axiomatizations for multiple hedges as an expansion of a core fuzzy logic in one axiomatization hedges do not have any dual one while in the other each hedge can have its own dual one it is shown that the proposed logics not only cover a large class of hedge functions but also have all completeness properties as the underlying logic w r t the class of their chains as well as distinguished subclasses of their chains including standard completeness the axiomatizations are also extended to the first order level furthermore we present a method to build linguistic fuzzy logics based on the axiomatizations and a hedge algebra whose corresponding algebras use a linguistic truth domain taken from the hedge algebra for representing and reasoning with linguistically expressed human knowledge where truth values of vague sentences are given in linguistic terms

mtl algebras arising from partially ordered groups after dropping the implication like operation and reversing the order an mtl algebra becomes a partially ordered structure l 0 1 based on the single addition like operation furthermore may be restricted to a partial but cancellative addition without loss of information we deal in this paper with the case that the resulting partial algebra l 0 1 is embeddable into the positive cone of a partially ordered group it turns out that most of the examples of mtl algebras known at present can be represented in this way so the systematisation of a considerable class of mtl algebras is achieved and the methods of their construction are brought onto a common line

uninorm logic with the n potency axiom this paper investigates a class of extensions c nul of uninorm logic ul which is obtained by adding the n potency axiom to ul the main result of this paper is that by generalizing jenei and montagna style approach for proving standard completeness for monoidal t norm based logic mtl we obtain the standard completeness for c nul in addition we present the suitable analytic hypersequent calculi for c nul

static and dynamic anomalies in a repulsive spherical ramp liquid theory and simulation we compare theoretical and simulation results for static and dynamic properties for a model of particles interacting via a spherically symmetric repulsive ramp potential the model displays anomalies similar to those found in liquid water namely expansion upon cooling and an increase of diffusivity upon compression in particular we calculate the state points p t from the simulation and successfully compare it with the state points p t obtained using the rogers young ry closure for the ornstein zernike oz equation both the theoretical and the numerical calculations confirm the presence of a line of isobaric density maxima and lines of compressibility minima and maxima indirect evidence of a liquid liquid critical point is found dynamic properties also show anomalies along constant temperature paths as the density increases the dynamics alternate between slowing down and speeding up and we associate this behavior with the progressive structuring and destructuring of the liquid finally we confirm that mode coupling theory successfully predicts the nonmonotonic behavior of dynamics and the presence of multiple glass phases providing strong evidence that structure the only input of mode coupling theory controls dynamics

molecular mode coupling theory applied to a liquid of diatomic molecules we study the molecular mode coupling theory for a liquid of diatomic molecules the equations for the critical tensorial nonergodicity parameters f m ll q and the critical amplitudes of the beta relaxation h m ll q are solved up to a cutoff l co 2 without any further approximations here l m are indices of spherical harmonics contrary to previous studies where additional approximations were applied we find in agreement with simulations that all molecular degrees of freedom vitrify at a single temperature t c the theoretical results for the nonergodicity parameters and the critical amplitudes are compared with those from simulations the qualitative agreement is good for all molecular degrees of freedom to study the influence of the cutoff on the nonergodicity parameter we also calculate the nonergodicity parameters for an upper cutoff l co 4 in addition we also propose a method for the calculation of the critical nonergodicity parameter from the liquid side of transition

on ordinal sums of triangular norms on bounded lattices ordinal sums have been introduced in many different contexts e g for posets semigroups t norms copulas aggregation operators or quite recently for hoops in this contribution we focus on ordinal sums of t norms acting on some bounded lattice which is not necessarily a chain or an ordinal sum of posets necessary and sufficient conditions are provided for an ordinal sum operation yielding again a t norm on some bounded lattice whereas the operation is determined by an arbitrary selection of subintervals as carriers for arbitrary summand t norms by such also the structure of the underlying bounded lattice is investigated further it is shown that up to trivial cases there are no ordinal sum t norms on product lattices in general

solution of a system of linear equations with fuzzy numbers in this paper the interval nature of fuzzy numbers is revealed by showing that many interesting results from classical interval analysis transfer also into the fuzzy case the paper deals with a solution of a fuzzy interval system of linear equations i e a system in which fuzzy intervals numbers appear instead of crisp numbers

recognising the suzuki groups in their natural representations abstract under the assumption of a certain conjecture for which there exists strong experimental evidence we produce an efficient algorithm for constructive membership testing in the suzuki groups sz q where q 2 2 m 1 for some m 0 in their natural representations of degree 4 it is a las vegas algorithm with running time o log q field operations and a preprocessing step with running time o log q log log q field operations the latter step needs an oracle for the discrete logarithm problem in f q we also produce a recognition algorithm for sz q x this is a las vegas algorithm with running time o x 2 field operations finally we give a las vegas algorithm that given x h sz q for some h gl 4 q finds some g such that x g sz q the running time is o log q log log q x field operations implementations of the algorithms are available for the computer system magma

rough approximation operators on r0 algebras nilpotent minimum algebras with an application in formal logic l an abstract axiomatization to pawlak rough set theory in the context of r0 algebras equivalently nm algebras has been proposed in the present paper more precisely by employing the conjunction operator and the disjunction operator in r0 algebras the notions of rough upper approximation operator u and rough lower approximation operator l on r0 algebras are proposed respectively owing to the logical properties of and any r0 algebra equipped with l and u forms an abstract approximation space in the sense of g cattaneo a duality relationship between the set of lower crisp elements and the set of upper crisp elements is established and some important properties are examined moreover its connection with tarski closure interior approximation space and halmos closure interior approximation is studied such a pair of rough approximations on r0 algebras can naturally induce a pair of rough upper lower truth degrees for formulae in l some uncertainty measures such as roughness degree and accuracy degree are subsequently presented and two kinds of approximate reasoning methods merging rough approximation and fuzzy logic are eventually established

writing projective representations over subfields let g x be an absolutely irreducible subgroup of gl d k and let f be a proper subfield of the finite field k we present a practical algorithm to decide constructively whether or not g is conjugate to a subgroup of gl d f k where k denotes the centre of gl d k if the derived group of g also acts absolutely irreducibly then the algorithm is las vegas and costs o x d3 d2log f arithmetic operations in k this work forms part of a recognition project based on aschbacher s classification of maximal subgroups of gl d k

logical structure of fuzzy if then rules abstract this paper provides a logical basis for manipulation with fuzzy if then rules our theory is wide enough and it encompasses not only finding a conclusion by means of the compositional rule of inference due to lotfi a zadeh but also other kinds of approximate reasoning methods e g perception based deduction provided that there exists a possibility to characterize them within a formal logical system in contrast with other approaches employing variants of multiple valued first order logic the approach presented here employs fuzzy type theory of v novak which has sufficient expressive power to present the essential concepts and results in a compact elegant and justifiable form within the effectively formalized representation developed here based on a complete logical system it is possible to reconstruct numerous well known properties of cri related fuzzy inference methods albeit not from the analytic point of view as usually presented but as formal derivations of the logical system employed the authors are confident that eventually all relevant knowledge about fuzzy inference methods based on fuzzy if then rule bases will be represented formalized and backed up by proof within the well founded logical representation presented here an immediate positive consequence of this approach is that suddenly all elements of a fuzzy inference method based on fuzzy if then rules are first class citizens of the representation there are clear logically founded definitions for fuzzy if then rule bases to be consistent complete or independent

on some questions concerning the axiomatisation of wnm algebras and their subvarieties in a seminal paper esteva and godo introduced monoidal t norm based logic mtl and some of its prominent extensions such as nm and wnm we notice that nm is axiomatisable from imtl and hence mtl with one variable axioms by instantiating the wnm axiom over one variable this observation leads us here to study the logic axiomatised by extending mtl by this one variable axiom we shall refer to its equivalent algebraic semantics as the variety of ghp algebras for those algebras will be shown to form the largest variety of mtl algebras such that the falsum free reducts of the positive cones of their chains are the most general totally ordered godel hoops among other results we obtain a general description of ghp standard algebras and use the latter to characterise those extensions of wnm that can be obtained from ghp via the same set of extending axioms

rotation invariant t norms where triple rotation and rotation annihilation meet generalizing the notion of a zoom of a t norm not only allows to extend the triple rotation method and its corresponding decomposition but also allows to describe the interface between the triple rotation method and the rotation annihilation method an alternative view on the partition behind the rotation annihilation method is required to make both methods compatible besides zooms we also use contour lines and the companion of a t norm to concisely formulate the results

constructive recognition of classical groups in even characteristic abstract let g x gl d f be a classical group in its natural representation defined over a finite field f of even characteristic we present las vegas algorithms to construct standard generators for g which permit us to write an element of g as a straight line program in x and to construct an involution as a straight line program in x if f 4 then the algorithms run in time polynomial in the size of the input subject to the existence of a discrete logarithm oracle for f

scott s formula and hurwitz groups abstract this paper continues previous work based on systematic use of a formula of l scott to detect hurwitz groups it closes the problem of determining the finite simple groups contained in pgl n f for n 7 which are hurwitz where f is an algebraically closed field for the groups g 2 q q 5 and the janko groups j 1 and j 2 it provides explicit 2 3 7 generators

the logic of tied implications part 1 properties applications and representation a conjunction t ties an implication operator a if the identity a a a b z a t a b z holds a a abdel hamid n n morsi associatively tied implications fuzzy sets and systems 136 2003 291 311 we study the class of tied adjointness algebras which are five connective algebras on two partially ordered sets in which the implications are tied by triangular norms this class contains besides residuated implications several other implications employed in fuzzy logic nevertheless we show that the algebraic inequalities of residuated algebras remain true for our tied implications but in forms that distribute roles over the five connectives of the algebra we apply the properties of tied implications to a generalized modus ponens inference scheme with two successive rules we prove its equivalence to a scheme with one compound rule when both schemata are interpreted by the compositional rule of inference and all connectives are taken from one tied adjointness algebra then we quote another application of this rich theory a notion of many valued rough sets which exhibit the basic mathematical behaviour of the rough sets of pawlak a comparator h is said to be prelinear if it satisfies h y z h z y 1 for all y z hajek we introduce prelinear tied adjointness algebras in which two comparators are prelinear we provide a representation of those algebras as subdirect products of tied adjointness chains on the lines of hajek s representation of bl algebras but our representations are more economical because we employ minimal prime filters on residuated lattices only rather than all prime filters

characterizations of maximal consistent theories in the formal deductive system l nm logic and cantor space a maximal consistent theory is a maximal theory with respect to its consistency the present paper is divided into two parts the first one is devoted to characterize the maximality of a consistent theory in the formal deductive system l which is a logic system equivalent to the nilpotent minimum logic it is proved that each maximal consistent theory in this logic must be the deductive closure of a collection of simple compound formulas hence it follows that there is a one to one correspondence between the set of all maximal consistent theories and the set of evaluations e assigning to each propositional variable p its truth degree e p 0 12 1 the satisfiability theorem and compactness theorem of l are obtained the second part is to investigate the topological structure of the set of all maximal consistent theories over l and the results show that this topological space is a cantor space

topology on bl algebras in this paper by using a special family of filters on a bl algebra l we construct a topology on l show that l is a topological bl algebra find the closure of any subsets of l and obtain some conditions under which that l is a hausdorff space also we prove some theorems about connected components of this topological space and use them to construct a quotient semitopological bl algebras finally we introduce the concept of complete bl algebra and attempt to construct a complete bl algebra from l

quantitative test of the mode coupling theory of the ideal glass transition for a binary lennard jones system using a molecular dynamics computer simulation we determine the temperature dependence of the partial structure factors for a binary lennard jones system these structure factors are used as input data to solve numerically the wave vector dependent mode coupling equations in the long time limit using the so determined solutions we compare the predictions of mode coupling theory mct with the results of a previously done molecular dynamics computer simulation phys rev e 51 4626 1995 52 4134 1995 from this comparison we conclude that mct gives a fair estimate of the critical coupling constant gives a good estimate of the exponent parameter predicts the wave vector dependence of the various nonergodicity parameters very well except for very large wave vectors and gives also a very good description of the space dependence of the various critical amplitudes in an attempt to correct for some of the remaining discrepancies between the theory and the results of the simulation we investigate two small ad hoc modifications of the theory we find that one modification gives worse agreement between theory and simulation whereas the second one leads to improved agreement

discrete dualities for n potent mtl algebras and 2 potent bl algebras abstract discrete dualities are developed for n potent mtl algebras and for 2 potent bl algebras that is classes of frames or relational systems are defined that serve as dual counterparts to these classes of algebras the frames defined here are extensions of the frames that were developed for mtl algebras in 24 and 25 the additional frame conditions required are given here and also the proofs that discrete dualities hold with respect to such frames the duality also provides an embedding from an n potent mtl algebra or 2 potent bl algebra into the complex algebra of its canonical frame which is a complete algebra in the lattice sense

an early approach toward graded identity and graded membership in set theory the paper considers an early approach toward a fuzzy set theory with a graded membership predicate and a graded equality relation which had been developed by the german mathematician klaua in 1965 in the context of the mathematical fuzzy logic mtl of left continuous t norms we discuss some properties of these graded relations we compare the simultaneous recursive definitions of these relations with the very similar approach toward boolean algebra valued interpretations of membership and equality presented in 1967 by scott and r solovay in the context of independence proofs for zf set theory finally we speculate about possible reasons why klaua soon abandoned this approach

density elimination density elimination a close relative of cut elimination consists of removing applications of the takeuti titani density rule from derivations in gentzen style hypersequent calculi its most important use is as a crucial step in establishing standard completeness for syntactic presentations of fuzzy logics that is completeness with respect to algebras based on the real unit interval 0 1 this paper introduces the method of density elimination by substitutions for general classes of first order hypersequent calculi it is shown that density elimination by substitutions is guaranteed by known sufficient conditions for cut elimination these results provide the basis for uniform characterizations of calculi complete with respect to densely and linearly ordered algebras standard completeness follows for many first order fuzzy logics using a dedekind macneille style completion and embedding

prenex normal form in linguistic quantifiers modeled by sugeno integrals in this paper ying s prenex normal form theorem for linguistic quantifiers is strengthened so that it behaves like the one in the classical logic this result further shows elegant logical properties of ying s framework

maxima and minima in fuzzified linear orderings the paper studies the notions of fuzzy maxima minima suprema and infima in the setting of fuzzified linear orderings the main result shows that in fuzzified linear orders satisfying certain reasonable assumptions the fuzzy maxima and minima of all non empty fuzzy sets are non empty

some types of filters in mtl algebras the aim of this work is to introduce the concepts of imtl filters and strong mtl filters in mtl algebras and show that these filters are related to imtl algebras and strong mtl algebras respectively we also introduce the concepts of eimtl and associative filters in mtl algebras the relationships between these filters and quotient algebras that are constructed via these filters are described we clarify that eimtl imtl and fantastic filters coincide in bl algebras whereas they have different properties in mtl algebras moreover the relations between them are delineated we prove that strong filters include some current filters such as implicative positive implicative and fantastic filters

constructing composition factors for a linear group in polynomial time abstract we present a las vegas polynomial time algorithm that takes as input a subgroup of gl d f q and subject to the existence of certain oracles determines its composition factors provided that none of those factors is isomorphic to one of b 2 2 2 2 k 1 f 4 2 2 2 k 1 d 4 3 2 k or g 2 2 3 2 k 1 for any k

fuzzy sets and formal logics the paper discusses the relationship between fuzzy sets and formal logics as well as the influences fuzzy set theory had on the development of particular formal logics our focus is on the historical side of these developments

issues on adjointness in multiple valued logics we contribute to the theory of implications and conjunctions related by adjointness in multiple valued logics we suggest their use in zadeh s compositional rule of inference to interpret generalized modus ponens inference schemata we provide new complete characterizations of implications that distinguish left arguments implications that satisfy the exchange principle divisible conjunctions commutative conjunctions associative conjunctions and triangular norms we also introduce and characterize pseudo strict and pseudo continuous implications and conjunctions and we explore the close relationship between these two notions

some kinds of c ccq interval valued fuzzy ideals of bci algebras in this paper we first introduce the notions of positive implicative implicative and commutative interval valued fuzzy ideals of bci algebras which are generalizations of positive implicative implicative and commutative fuzzy ideals respectively and investigate some of their related properties the concept of quasi coincidence of an interval valued fuzzy point within an interval valued fuzzy set is introduced in fact the concept is a generalized concept of quasi coincidence of a fuzzy point within a fuzzy set by using this new idea we further introduce the notions of positive implicative implicative and commutative q interval valued fuzzy ideals of bci algebras and investigate some of their related properties some characterization theorems of these generalized interval valued fuzzy ideals are derived the relationship among these generalized interval valued fuzzy ideals of bci algebras is also considered

an algebraic approach to linguistic hedges in zadeh s fuzzy logic the paper addresses the mathematical modelling of domains of linguistic variables i e term sets of linguistic variables in order to obtain a suitable algebraic structure for the set of truth values of zadeh s fuzzy logic we shall give a unified algebraic approach to the natural structure of domains of linguistic variables which was proposed by ho and wechler fuzzy sets and systems 35 1990 281 and then by ho and nam proc ncst vietnam 9 1 1997 15 logic algebra and computer science vol 46 banach center publications pwn warsaw 1999 p 63 in this approach every linguistic domain can be considered as an algebraic structure called hedge algebra because properties of its unary operations reflect semantic characteristics of linguistic hedges many fundamental properties of refined hedge algebras rh algebras are examined especially it is shown that every rh algebra of a linguistic variable with a chain of the primary terms is a distributive lattice rh algebras with exactly two distinct primary terms one being an antonym of the other will also be investigated and they will be called symmetrical rh algebras it is shown that a class of finite symmetrical rh algebras has a rich enough algebraic structure

continuous weakly cancellative triangular subnorms i their web geometric properties abstract the paper studies web geometric properties of continuous weakly cancellative t subnorms particularly it studies the reidemeister closure condition which is known from web geometry as a visual characterization of those loops that are associative as a result the paper delimits a subset of the domain of a continuous weakly cancellative t subnorm in which the reidemeister closure condition is necessarily satisfied

an enriched category approach to many valued topology in this paper we discuss a basic question in fuzzy set theory what is a many valued topology on a set x an answer is presented by interpreting the axioms two logical formulas for classical topological spaces in the fuzzy setting making use of the intrinsic fuzzy partial order on the fuzzy power set of x as preparation a systematic investigation of fuzzy partial orders is presented from the viewpoint of enriched category theory

on the scope of some formulas defining additive connectives in fuzzy logics in fuzzy sets and systems 149 2005 297 wang et al defined a new fuzzy logic called nmg they also introduced new formulas to define the additive connectives from multiplicative conjunction residuated implication and bottom in nmg however they did not study the scope of these formulas in the general framework of fuzzy logics this is the aim of this paper therefore we add the definability formulas to known fuzzy logics as new axioms following the method used in beyond two theory and applications of multiple valued logic 2003 251 and we obtain some families of logics presented in a simpler language finally we discuss the standard completeness of these new logics

the maximal subgroups of the chevalley groups g2 q with q odd the ree groups 2g2 q and their automorphism groups

a new axiomatization for involutive monoidal t norm based logic on the real unit interval the notion of a girard monoid coincides with the notion of a t norm based residuated lattice with strong induced negation a geometrical approach toward these girard monoids based on the notion of rotation invariance is turned in an adequate axiomatization for the involutive monoidal t norm based residuated logic

on deductive interpolation for the weak nilpotent minimum logic the weak nilpotent minimum logic wnm was introduced by esteva and godo in 6 and shown to be the logic of the class of weak nilpotent minimum triangular norms in this article we prove that wnm admits the deductive interpolation property by showing through a model theoretic argument that the corresponding variety of algebras has the amalgamation property

constructive recognition of mathrm psl 2 q existing black box and other algorithms for explicitly recognising groups of lie type over gf q have asymptotic running times which are polynomial in q whereas the input size involves only log q this has represented a serious obstruction to the efficient recognition of such groups recently brooksbank and kantor devised new explicit recognition algorithms for classical groups these run in time that is polynomial in the size of the input given an oracle that recognises psl 2 q explicitly the present paper in conjunction with an earlier paper by the first two authors provides such an oracle the earlier paper produced an algorithm for explicitly recognising sl 2 q in its natural representation in polynomial time given a discrete logarithm oracle for gf q the algorithm presented here takes as input a generating set for a subgroup g of gl d f that is isomorphic modulo scalars to psl 2 q where f is a finite field of the same characteristic as gf q it returns the natural representation of g modulo scalars since a faithful projective representation of psl 2 q in cross characteristic or a faithful permutation representation of this group is necessarily of size that is polynomial in q rather than in log q elementary algorithms will recognise psl 2 q explicitly in polynomial time in these cases given a discrete logarithm oracle for gf q our algorithm thus provides the required polynomial time oracle for recognising psl 2 q explicitly in the remaining case namely for representations in the natural characteristic this leads to a partial solution of a question posed by babai and shalev if g is a matrix group in characteristic p determine in polynomial time whether or not op g is trivial

adjoint negations more than residuated negations negation operators are useful operators which have extensively been studied and used in different fuzzy settings such as in fuzzy logic this paper introduces a new and flexible kind of negation operator based on adjoint triples and which is called adjoint negation relative to a fixed element besides proving several interesting properties the comparison with weak negations studied by trillas esteva et al and pairs of weak negations introduced by georgescu and popescu is presented furthermore adjoint negations are used in order to define the corresponding dual disjunctive to an adjoint conjunctor

parameterizing the semantics of fuzzy attribute implications by systems of isotone galois connections we study the semantics of fuzzy if then rules called fuzzy attribute implications parameterized by systems of isotone galois connections the rules express dependences between fuzzy attributes in object attribute incidence data the proposed parameterizations are general and include as special cases the parameterizations by linguistic hedges used in earlier approaches we formalize the general parameterizations propose bivalent and graded notions of semantic entailment of fuzzy attribute implications show their characterization in terms of least models and complete axiomatization and provide characterization of bases of fuzzy attribute implications derived from data

semi divisible t norms on discrete scales semi divisibility of left continuous triangular norms is a weakened version of the divisibility axiom the t norms on l 0 1 n 2 n 1 which fulfil the semi divisibility axiom are studied the only semi divisible t norm with ran n t l is shown to correspond to the lukasiewicz t norm several examples of semi divisible discrete t norms are shown

monoidal t norm based logic towards a logic for left continuous t norms hajek s bl logic is the fuzzy logic capturing the tautologies of continuous t norms and their residua in this paper we investigate a weaker logic mtl which is intended to cope with the tautologies of left continuous t norms and their residua the corresponding algebraic structures mtl algebras are defined and completeness of mtl with respect to linearly ordered mtl algebras is proved besides several schematic extensions of mtl are also considered as well as their corresponding predicate calculi

term satisfiability in flew algebras fl ew algebras form the algebraic semantics of the full lambek calculus with exchange and weakening we investigate two relations called satisfiability and positive satisfiability between fl ew terms and fl ew algebras for each fl ew algebra the sets of its satisfiable and positively satisfiable terms can be viewed as fragments of its existential theory we identify and investigate the complements as fragments of its universal theory we offer characterizations of those algebras that positively satisfy just those terms that are satisfiable in the two element boolean algebra providing its semantics to classical propositional logic in case of positive satisfiability these algebras are just the nontrivial weakly contractive fl ew algebras in case of satisfiability we give a characterization by means of another property of the algebra the existence of a two element congruence further we argue that positive satisfiability problems in fl ew algebras are computationally hard some previous results in the area of term satisfiability in mv algebras or bl algebras are thus brought to a common footing with known facts on satisfiability in heyting algebras

recognising the small ree groups in their natural representations we present las vegas algorithms for constructive recognition and constructive membership testing of the ree groups g22 q ree q where q 32m 1 for some m 0 in their natural representations of degree 7 the input is a generating set x gl 7 q the constructive recognition algorithm is polynomial time given a discrete logarithm oracle the constructive membership testing consists of a pre processing step that only needs to be executed once for a given x and a main step the latter is polynomial time and the former is polynomial time given a discrete logarithm oracle implementations of the algorithms are available for the computer algebra system magma

recognition of finite exceptional groups of lie type let q be a prime power and let g be an absolutely irreducible subgroup of gld f where f is a finite field of the same characteristic as fq the field of q elements assume that g g q a quasisimple group of exceptional lie type over fq which is neither a suzuki nor a ree group we present a las vegas algorithm that constructs an isomorphism from g to the standard copy of g q if g 6 3d4 q with q even then the algorithm runs in polynomial time subject to the existence of a discrete log oracle

a characterization of truth functions in the nilpotent minimum logic abstract by introducing a new family of partitions into the n cube 0 1 n the problem of characterizing truth tables of formulas in the nilpotent minimum logic is solved and their normal forms are presented so far only this kind of fuzzy truth functions have normal forms among all fuzzy propositional calculi which are based on left continuous but discontinuous t norm

a graded notion of functionality abstract we will introduce the notion of functionality as a graded property of a fuzzy relation we will extend known results relating to functional fuzzy relations to their graded counterparts and provide new properties w r t various kinds of relational compositions as a contribution to the theory of fuzzy control we will moreover provide an example of use of graded properties in establishing implicative models of fuzzy rule bases where the non graded property fails