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

Displaying 21 – 40 of 51

Showing per page

Entropies of vague information sources

Milan Mareš (2011)

Kybernetika

The information-theoretical entropy is an effective measure of uncertainty connected with an information source. Its transfer from the classical probabilistic information theory models to the fuzzy set theoretical environment is desirable and significant attempts were realized in the existing literature. Nevertheless, there are some open topics for analysis in the suggested models of fuzzy entropy - the main of them regard the formal aspects of the fundamental concepts. Namely their rather additive...

Entropy of T -sums and T -products of L - R fuzzy numbers

Anna Kolesárová, Doretta Vivona (2001)

Kybernetika

In the paper the entropy of L – R fuzzy numbers is studied. It is shown that for a given norm function, the computation of the entropy of L – R fuzzy numbers reduces to using a simple formula which depends only on the spreads and shape functions of incoming numbers. In detail the entropy of T M –sums and T M –products of L – R fuzzy numbers is investigated. It is shown that the resulting entropy can be computed only by means of the entropy of incoming fuzzy numbers or by means of their parameters without the...

Entropy on effect algebras with the Riesz decomposition property I: Basic properties

Antonio Di Nola, Anatolij Dvurečenskij, Marek Hyčko, Corrado Manara (2005)

Kybernetika

We define the entropy, lower and upper entropy, and the conditional entropy of a dynamical system consisting of an effect algebra with the Riesz decomposition property, a state, and a transformation. Such effect algebras allow many refinements of two partitions. We present the basic properties of these entropies and these notions are illustrated by many examples. Entropy on MV-algebras is postponed to Part II.

Enumerated type semantics for the calculus of looping sequences

Livio Bioglio (2011)

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

The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure and...

Enumerated type semantics for the calculus of looping sequences

Livio Bioglio (2011)

RAIRO - Theoretical Informatics and Applications

The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure...

Equivalent Expressions of Direct Sum Decomposition of Groups1

Kazuhisa Nakasho, Hiroyuki Okazaki, Hiroshi Yamazaki, Yasunari Shidama (2015)

Formalized Mathematics

In this article, the equivalent expressions of the direct sum decomposition of groups are mainly discussed. In the first section, we formalize the fact that the internal direct sum decomposition can be defined as normal subgroups and some of their properties. In the second section, we formalize an equivalent form of internal direct sum of commutative groups. In the last section, we formalize that the external direct sum leads an internal direct sum. We referred to [19], [18] [8] and [14] in the...

Equivalent fuzzy sets

Branimir Šešelja, Andreja Tepavčević (2005)

Kybernetika

Necessary and sufficient conditions under which two fuzzy sets (in the most general, poset valued setting) with the same domain have equal families of cut sets are given. The corresponding equivalence relation on the related fuzzy power set is investigated. Relationship of poset valued fuzzy sets and fuzzy sets for which the co-domain is Dedekind-MacNeille completion of that posets is deduced.

Estensioni contraddittorie della teoria Ampia

Giacomo Lenzi (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Dopo una breve presentazione della teoria A , una teoria non riduzionista ed autoreferenziale dei fondamenti della matematica proposta da Clavelli, De Giorgi, Forti e Tortorelli nel 1987, si mostra l'inconsistenza di estensioni della teoria A ottenute aggiungendo forti assiomi su relazioni e operazioni (ad es. assiomi che danno la composizione di operazioni, la congiunzione di relazioni, ecc.) e/o assiomi che forniscono qualche relazione "combinatoria".

Euler’s Partition Theorem

Karol Pąk (2015)

Formalized Mathematics

In this article we prove the Euler’s Partition Theorem which states that the number of integer partitions with odd parts equals the number of partitions with distinct parts. The formalization follows H.S. Wilf’s lecture notes [28] (see also [1]). Euler’s Partition Theorem is listed as item #45 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/ [27].

Currently displaying 21 – 40 of 51