The study of computer design and architecture includes many topics on formal languages and discrete structures. Among these are state minimizations, Boolean algebra, and switching algebra. In minimization, three approaches are normally used that are based on equivalence relations. Partial order relations are used today in constructions of Boolean algebra. In this paper we survey this important ...

In this paper, we shall introduce generalized fuzzy compactness in L-spaces where L is a complete de Morgan algebra. This definition does not rely on the structure of basis lattice L and no distributivity is required. The intersection of a generalized fuzzy compact L-set and a generalized closed Lset is a generalized fuzzy compact L-set. The generalized irresolute image of a generalized fuzzy c...

We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e. Baxter permutations, pairs of twin binary trees, etc.). This construction relies on the definition of the Baxter monoid, analog of the plactic monoid and the sylvester monoid, and on a Robinson-Schensted-like ...

We present the basic analytical and algebraic properties of triangular norms. We discuss continuity as well as the important classes of Archimedean, strict and nilpotent t-norms. Triangular conorms and De Morgan triples are also mentioned. Finally, a brief historical survey on triangular norms is given. Submitted for publication Johannes Kepler Universität Linz Fuzzy Logic Laboratorium Linz-Hag...

in this paper, we give a characterization of strongly jordan zero-product preserving maps on normed algebras as a generalization of  jordan zero-product preserving maps. in this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly jordan zero-product preserving maps are completely different. also, we prove that the direct p...

A Heyting algebra is supplemented if each element a has dual pseudo-complement $$a^+$$ , and centrally supplement it central. We show that extension in the same variety of algebras as original. use this tool to investigate new type completion arising context algebraic proof theory, so-called hyper-MacNeille completion. MacNeille its extension. This provides an description algebra, allows develo...

We analyze the structure of the Malvenuto-Reutenauer Hopf algebra of permutations in detail. We give explicit formulas for its antipode, prove that it is a cofree coalgebra, determine its primitive elements and its coradical filtration and show that it decomposes as a crossed product over the Hopf algebra of quasi-symmetric functions. We also describe the structure constants of the multiplicati...

We analyze the structure of the Malvenuto-Reutenauer Hopf algebra of permutations in detail. We give explicit formulas for its antipode, prove that it is a cofree coalgebra, determine its primitive elements and its coradical filtration and show that it decomposes as a crossed product over the Hopf algebra of quasi-symmetric functions. We also describe the structure constants of the multiplicati...

Morphisms of some categories of sets with similarity relations (Ω-sets) are investigated, where Ω is a complete residuated lattice. Namely a category SetF(Ω) with morphisms (A, δ) → (B, γ) defined as special maps A → B and a category SetR(Ω) with morphisms defined as a special relations A × B → Ω. It is proved that arbitrary maps A → Ω and A × B → Ω can be extended onto morphisms (A, δ) → (Ω,↔)...

We introduce a suitable notion of bisimulation for the family of Heyting-valued modal logics introduced by M. Fitting. In this family of logics, each modal language is built on an underlying space of truth values, a Heyting algebra H. All the truth values are directly represented in the language which is interpreted on relational frames with an H-valued accessibility relation. We prove that for...