نتایج جستجو برای: congruence permutability
تعداد نتایج: 8457 فیلتر نتایج به سال:
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...
We present a proof-theoretic foundation for logic programming in Girard's linear logic. We exploit the permutability properties of two-sided linear sequent calculus to identify appropriate notions of uniform proof, deenite formula, goal formula, clause and resolution proof for fragments of linear logic. The analysis of this paper extends earlier work by the present authors to include negative o...
the aim of the present research was to investigate the relationship between the components of organizational intelligence and organizational culture in physical education general office and offices in east azerbaijan province. the present research was a descriptive – correlation one and performed as a field. the statistical population consisted of the staff of physical education general office ...
Congruence Closure and Applications Congruence closure algorithms for solving word problems for finitely pre-sented algebras have also been used in combining decision procedures. Onthe other hand, congruence closure can itself be looked upon as a combina-tion problem. Taking this view leads us to define the notion of an abstractcongruence closure. We present a completion based d...
A congruence relation θ on an algebra A is fully invariant if every endomorphism of A preserves θ. A congruence θ is verbal if there exists a variety V such that θ is the least congruence of A such that A/θ ∈ V. Every verbal congruence relation is known to be fully invariant. This paper investigates fully invariant congruence relations that are verbal, algebras whose fully invariant congruences...
We use methods of the general theory of congruence and *congruence for complex matrices—regularization and cosquares—to determine a unitary congruence canonical form (respectively, a unitary *congruence canonical form) for complex matrices A such that ĀA (respectively, A) is normal. As special cases of our canonical forms, we obtain—in a coherent and systematic way—known canonical forms for con...
We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید