End-extending models of
End-extensions of countable structures and the induction schema
Endofunctors of set and cardinalities
Endomorphic cuts and tails
Endomorphic universes and their standard extensions
Endomorphisms of symbolic algebraic varieties
The theorem of Ax says that any regular selfmapping of a complex algebraic variety is either surjective or non-injective; this property is called surjunctivity and investigated in the present paper in the category of proregular mappings of proalgebraic spaces. We show that such maps are surjunctive if they commute with sufficiently large automorphism groups. Of particular interest is the case of proalgebraic varieties over infinite graphs. The paper intends to bring out relations between model theory,...
Endothéorie de Galois abstraite
Engel BCI-algebras: an application of left and right commutators
We introduce Engel elements in a BCI-algebra by using left and right normed commutators, and some properties of these elements are studied. The notion of -Engel BCI-algebra as a natural generalization of commutative BCI-algebras is introduced, and we discuss Engel BCI-algebra, which is defined by left and right normed commutators. In particular, we prove that any nilpotent BCI-algebra of type is an Engel BCI-algebra, but solvable BCI-algebras are not Engel, generally. Also, it is proved that...
Enlargements of Boolean algebras and Stone spaces
Enlargements of categories.
Enlargements without urelements
Ensembles analytiques, théorèmes de séparation et applications
Entropic Hopf algebras and models of non-commutative logic.
Entropies of vague information sources
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 -sums and -products of - fuzzy numbers
In the paper the entropy of – fuzzy numbers is studied. It is shown that for a given norm function, the computation of the entropy of – 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 –sums and –products of – 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 Riesz decomposition property II: MV-algebras
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.
Entropy on effect algebras with the Riesz decomposition property I: Basic properties
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.
Entscheidungsprobleme der Theorie zweier Äquivalenzrelationen mit beschränkter Zahl vоn Elementen in den Klassen
Enumerated type semantics for the calculus of looping sequences
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
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...