The theory of chi processes with the mismatch operator is studied. Two open congruence relations are investigated. These are weak early open congruence and weak late open congruence. Complete systems are given for both congruence relations. These systems use some new tau laws. The results of this paper correct some popular mistakes in literature.

This paper deenes a congruence relation on Gamma programs. Based on this congruence relation, laws for transforming programs are derived. We deene an axiomatic semantics for Gamma based on Brookes' transition assertions. The deenition of the congruence is in terms of provable satissability of such assertions. We consider the relationship between our congruence and other orderings that have been...

The class of Guaranteed Scoring Games (GS) is the class of all two-player scoring combinatorial games with the property that Normal-play games (Conway et. al.) are order embedded into GS. They include, as subclasses, the scoring games considered by Milnor (1953), Ettinger (1996) and Johnson (2014). We present the structure of GS and the techniques needed to analyze a sum of guaranteed games. Fi...

the object of this paper is to introduce the notion of intuitionisticfuzzy continuous mappings and intuitionistic fuzzy bounded linear operatorsfrom one intuitionistic fuzzy n-normed linear space to another. relation betweenintuitionistic fuzzy continuity and intuitionistic fuzzy bounded linearoperators are studied and some interesting results are obtained.

We study congruences on the partial automorphism monoid of a finite rank free group action. determine decomposition congruence this into Rees congruence, Brandt semigroup and an idempotent separating congruence. The constituent parts are further described in terms subgroups direct semidirect products groups. utilize description to demonstrate how number depends

We construct the first examples of normal subgroups mapping class groups that are isomorphic to non-free right-angled Artin groups. Our construction also gives normal, other groups, such as braid and pure well many group, Torelli subgroup. work recovers generalizes seminal result Dahmani–Guirardel–Osin, which free, purely pseudo-Anosov give two applications our methods: (1) we produce an explic...

An equational logic program is a set of directed equations or rules, which are used to compute in the obvious way (by replacing equals with “simpler” equals). We present static analysis techniques for efficient equational logic programming, some of which have been implemented in LR, a laboratory for developing and evaluating fast, efficient, and practical rewriting techniques. Two novel feature...

The Independence Theorem for the congruence lattice and the auto-morphism group of a nite lattice was proved by V. A. Baranski and A. Urquhart. Both proofs utilize the characterization theorem of congruence lattices of nite lattices (as nite distributive lattices) and the characterization theorem of auto-morphism groups of nite lattices (as nite groups). In this paper, we introduce a new, stron...

We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: Two processes are equivalent if and only if they are mapped into graphs with the same normal form. Most importantly, the encoding allows the use of standard graph rewri...

An ω-language over a finite alphabet X is a set of infinite sequences of letters of X. Previously studied syntactic equivalence relations defined by ω-languages have mainly been relations on X∗. In this paper the emphasis is put on relations in Xω, by associating to an ω-language L a congruence on Xω, called the ω-syntactic congruence of L. Properties of this congruence and notions induced by i...