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...

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...

We study the entropy mainly on special effect algebras with (RDP), namely on tribes of fuzzy sets and sigma-complete MV-algebras. We generalize results from [RiMu] and [RiNe] which were known only for special tribes.

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.

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...

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...

We consider shifted equality sets of the form $E_G(a,g_1,g_2)=\{w\mid g_1\left(w\right)=a{g}_2\left(w\right)\}$, where $g_1$ and $g_2$ are nonerasing morphisms and $a$ is a letter. We are interested in the family consisting of the languages $h\left(E_G\left(J\right)\right)$, where $h$ is a coding and $E_G\left(J\right)$ is a shifted equality set. We prove several closure properties for this family. Moreover, we show that every recursively enumerable language $L\subseteq A^{*}$ is a projection of a shifted equality set, that is, $L={\pi }_A\left(E_G(a,g_1,g_2)\right)$ for some (nonerasing) morphisms $g_1$ and $g_2$ and a letter $a$, where ${\pi }_A$ deletes the letters not in $A$. Then we deduce...

We consider shifted equality sets of the form EG(a,g1,g2) = {ω | g1(ω) = ag2(ω)}, where g1 and g2 are nonerasing morphisms and a is a letter. We are interested in the family consisting of the languages h(EG(J)), where h is a coding and (EG(J)) is a shifted equality set. We prove several closure properties for this family. Moreover, we show that every recursively enumerable language L ⊆ A* is a projection of a shifted equality set, that is, L = πA(EG(a,g1,g2)) for some (nonerasing) morphisms g1...

We prove that an equational class of Hilbert algebras cannot be defined by a single equation. In particular Hilbert algebras and implication algebras are not one-based. Also, we use a seminal theorem of Alfred Tarski in equational logic to characterize the set of cardinalities of all finite irredundant bases of the varieties of Hilbert algebras, implication algebras and commutative BCK algebras: all these varieties can be defined by independent bases of n elements, for each n > 1.

Two linear orderings are equimorphic if they can be embedded in each other. We define invariants for scattered linear orderings which classify them up to equimorphism. Essentially, these invariants are finite sequences of finite trees with ordinal labels. Also, for each ordinal α, we explicitly describe the finite set of minimal scattered equimorphism types of Hausdorff rank α. We compute the invariants of each of these minimal types..