Starting with the underlying motivation of developing a general theory of L-fuzzy sets where L is a multilattice (a particular case of non-deterministic algebra), we study the relationship between the crisp notions of congruence, homomorphism and substructure on some non-deterministic algebras which have been used in the literature, i.e. hypergroups, and join spaces. Moreover, we provide suitab...

EQ-algebras were introduced by Novak (2006) as an algebraic structure of truth values for fuzzy-type theory (FFT). Novák and De Baets (2009) various kinds such good, residuated, IEQ-algebras. In this paper, we define the notion (pre)ideal in bounded (BEQ-algebras) investigate some properties. Then, introduce a congruence relation on good BEQ-algebras using ideals, then, solve open problem Paad ...

the present paper introduces the notion of the complete fuzzy norm on a linear space. and, some relations between the fuzzy completeness and ordinary completeness on a linear space is considered, moreover a new form of fuzzy compact spaces, namely b-compact spaces and b-closed spaces are introduced. some characterizations of their properties are obtained.

9 The theory of chi processes with the mismatch operator is studied. Four congruence relations are investigated. These are late open congruence, early open congruence, ground congruence and 11 barbed congruence. The late and early open congruence relations are the chi calculus counterparts of the weak late and early congruence relations of pi calculus. Both turn out to be special cases 13 of th...

Flat iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the rst argument to be a sum of atomic actions. It generalizes pre x iteration, in which the rst argument is a single action. Complete nite equational axiomatizations are given for ve notions of bisimulation congruence over basic CCS with at iteration, viz. strong congruence, b...

During the last decade, CCS has been extended in diierent directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence 31]. Observational congruence is fair in the sense that it is possible to escape divergence, reeected by the axiom recX:(:X + P) = recX:::P. In this paper we discuss observational cong...

During the last decade, CCS has been extended in diier-ent directions, among them priority and real time. One of the most satisfactory results for CCS is Milner's complete proof system for observational congruence 28]. Observational congruence is fair in the sense that it is possible to escape divergence, reeected by an axiom recX:(:X + P) = recX:::P. In this paper we discuss observational cong...

This paper ooers a complete inference system for branching bisimulation congruence on a basic sublanguage of CCS for representing regular processes with silent moves. Moreover, complete axiomatizations are provided for the guarded expressions in this language, representing the divergence-free processes, and for the recursion-free expressions, representing the nite processes. Furthermore it is a...

In program algebra, an algebraic theory of single-pass instruction sequences, three congruences on instruction sequences are paid attention to: instruction sequence congruence, structural congruence, and behavioural congruence. Sound and complete axiom systems for the first two congruences were already given in early papers on program algebra. The current paper is the first one that is concerne...