We show how to find a complete set of necessary and sufficient conditions that solve the fixed-parameter local congruence problem of immersions in G-spaces, whether homogeneous or not, provided that a certain k order jet bundle over the G-space admits a G-invariant local coframe field of constant structure. As a corollary, we note that the differential order of a minimal complete set of congrue...

Abstract An E -fuzzy group is a lattice-valued algebraic structure, defined on a crisp algebra which is not necessarily a group. The crisp equality is replaced by a particular fuzzy one denoted by E . Classical group-like properties are formulated as appropriate fuzzy identities special lattice theoretic formulas. We prove basic features of E -fuzzy groups: properties of the unit and inverses, ...

Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. α.τ.β.nil and α.β.nil are woc but τ.β.nil and β.nil are not. This fact prevents us from characterizing CCS semantics (when τ is considered invisible) as a final algebra, since the semantic function would induce...

In this paper, the concept of fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) of an ordered group (resp. lattice-ordered group) is introduced and some properties, characterizations and related results are given. Also, the fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) generated by a fuzzy subgroup (resp. fuzzy subsemigroup) is characterized. Furthermore,...

The twisted partition monoid P n ? is an infinite obtained from the classical finite by taking into account number of floating components when multiplying partitions. main result this paper a complete description congruences on . succinct encoding congruence, which we call C-pair, consists sequence + 1 additive N natural numbers and certain ( ) × matrix. We also give inclusion ordering in terms...

Complete pre-orders can be characterized in terms of the transitivity of the corresponding strict preference and indifference relations. In this paper, we investigate this characterization in a fuzzy setting. We consider two types of completeness (weak completeness and strong completeness) and decompose a fuzzy pre-order by means of an indifference generator, in particular a Frank t-norm. In th...

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a typed higher order process calculus with active mobile processes, nested locations and local names which conservatively extends the syntax and semantics of higher-order calculi such as Plain CHOCS and HOpi. We prove that ...

It has been shown in previous papers that classes of (minimal asymmetric) informationally-complete positive operator valued measures (IC-POVMs) in dimension d can be built using the multiparticle Pauli group acting on appropriate fiducial states. The latter states may also be derived starting from the Poincaré upper half-plane model H. To do this, one translates the congruence (or non-congruenc...

We define the Cartesian product, composition, union and join on interval-valued fuzzy graphs and investigate some of their properties. We also introduce the notion of interval-valued fuzzy complete graphs and present some properties of self complementary and self weak complementary interval-valued fuzzy complete graphs.