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 3 Next

Displaying 41 – 60 of 85

Showing per page

Some Remarkable Identities Involving Numbers

Rafał Ziobro (2014)

Formalized Mathematics

The article focuses on simple identities found for binomials, their divisibility, and basic inequalities. A general formula allowing factorization of the sum of like powers is introduced and used to prove elementary theorems for natural numbers. Formulas for short multiplication are sometimes referred in English or French as remarkable identities. The same formulas could be found in works concerning polynomial factorization, where there exists no single term for various identities. Their usability...

Some results on complexity of μ-calculus evaluation in the black-box model

Paweł Parys (2013)

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

We consider μ-calculus formulas in a normal form: after a prefix of fixed-point quantifiers follows a quantifier-free expression. We are interested in the problem of evaluating (model checking) such formulas in a powerset lattice. We assume that the quantifier-free part of the expression can be any monotone function given by a black-box – we may only ask for its value for given arguments. As a first result we prove that when the lattice is fixed, the problem becomes polynomial (the assumption about...

Some results on the weak dominance relation between ordered weighted averaging operators and T-norms

Gang Li, Zhenbo Li, Jing Wang (2024)

Kybernetika

Aggregation operators have the important application in any fields where the fusion of information is processed. The dominance relation between two aggregation operators is linked to the fusion of fuzzy relations, indistinguishability operators and so on. In this paper, we deal with the weak dominance relation between two aggregation operators which is closely related with the dominance relation. Weak domination of isomorphic aggregation operators and ordinal sum of conjunctors is presented. More...

Specifying t-norms based on the value of T (1/2, 1/2).

Marcin Detyniecki, Ronald R. Yager, Bernadette Bouchon-Meunier (2000)

Mathware and Soft Computing

We study here the behavior of the t-norms at the point (1/2, 1/2). We indicate why this point can be considered as significant in the specification of t-norms. Then, we suggest that the image of this point can be used to classify the t-norms. We consider some usual examples. We also study the case of parameterized t-norms. Finally using the results of this study, we propose a uniform method of computing the parameters. This method allows not only having the same parameter-scale for all the families,...

Currently displaying 41 – 60 of 85