In this paper, the notions of fuzzy soft subalgebra and fuzzy soft convex subalgebra of a residuated lattice are introduced and some related properties are investigated. Then, we define fuzzy soft congruence on a residuated lattice and obtain the relation between fuzzy soft convex subalgebras and fuzzy soft congruence relations on residuated lattices. The concept of soft homomorphism is defined...

Abstract We investigate the geometry of almost Robinson manifolds, Lorentzian analogues Hermitian defined by Nurowski and Trautman as manifolds even dimension equipped with a totally null complex distribution maximal rank. Associated to such structure, there is congruence curves, which, in four, geodesic non-shearing if only involutive. Under suitable conditions, gives rise an Cauchy–Riemann st...

Congruence is probably the most complex of Rogers’ three therapist offered conditions, yet the least explicated. As Rogers developed his ideas, he came to see genuineness as the most basic of the conditions (Rogers and Sanford, 1984) Possibly because of it’s later emergence as a central element, it has not received as much attention as the other conditions, particularly empathy. We will discuss...

The paper is concerned with P/T nets with labeled and unlabeled places and transitions. An equivalence relation is deened for such nets, which abstracts from unlabeled nodes, generalizes place bisimilarity, preserves their branching structure and is a congruence for merge, relabeling, synchronization and reenement. The relation becomes a state-oriented one when all transitions are unlabeled and...

We present a constructor-based approach for assigning appropriate semantics to algebraic speciications given by nite sets of positive/negative-conditional equations. Under the assumption of con-uence of the reduction relation we deene, the factor algebra of the ground term algebra modulo the congruence of this reduction relation is a minimal model which is (beyond that) the minimum of all model...

The notion of logic adopted by Abstract Algebraic Logic stems from Tarki’s. By a logic we understand any consequence relation on the algebra of formulas of some propositional language, namely any relation ` between sets of formulas and formulas such that 1. φ ` φ; 2. if Γ ` φ and Γ ⊆ ∆, then ∆ ` φ; 3. if for every ψ ∈ Γ , ∆ ` ψ and Γ ` φ, then ∆ ` ψ; 4. if Γ ` φ, then for any substitution σ of ...

We start with a characterization of the modular commutator that was given by E Kiss and the rst author in DK and explore some of its consequences Implicit in this characterization is that both the shifting lemma and the cube lemma from Gu yield descriptions of the commutator in terms of implications of identities The shifting lemma translates into the well known term condition and the cube lemm...

We give a method for proving congruence of bisimulation-like equivalences in functional programming languages. The method applies to languages that can be presented as a set of expressions together with an evaluation relation. We use this method to show that some generalizations of Abramsky's applicative bisimulation are congruences whenever evaluation can be speci ed by a certain natural form ...

We present a new and useful congruence identity satisfied by m-permutable varieties. It has been proved in [L1] that every m-permutable variety satisfies a non-trivial lattice identity (depending only on m). In [L2] we have found another interesting identity: Theorem 1. For m ≥ 3, every m-permutable variety satisfies the congruence identity αβh = αγh, for h = m[ m+1 2 ]− 1 Here, [ ] denotes int...

Stochastic (Markovian) process algebras extend usual process algebras with probabilistic exponentially distributed time durations denoted by rates (the parameter of the exponential distribution). Defining a semantics for such algebras, so to derive Continuous Time Markov Chains from system specifications, requires dealing with transitions labeled by rates. With respect to standard process algeb...