Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting
نویسنده
چکیده
Using the notion of modified completion given in Widiger, A. (1998, Deciding degreefour-identities for alternative rings by rewriting. In Bronstein, M., Grabmeier, J., Weispfenning, V. eds, Symbolic Rewriting Techniques, PCS 15, pp. 277–288. BirkhäuserVerlag), it is shown that the word problem for the varieties of non-associative rings defined by (xy)z = y(zx) and (xy)z = y(xz) respectively can be decided by rewriting. c © 2001 Academic Press
منابع مشابه
Undecidability of Ground Reducibility for Word Rewriting Systems with Variables
Given a nite alphabet A and an alphabet of variables X we consider words over A X called words with variables or patterns and words over A called simply words or strings A nite set R of rewrite rules w v where w v are words with variables is called a word rewriting system with variables WRSV From the viewpoint of rewriting systems theory WRSV s are rewriting systems over a signature consisting ...
متن کاملRelating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings
A rst explicit connection between nitely presented commutative monoids and ideals in polynomial rings was used 1958 by Emelichev yielding a solution to the word problem in commutative monoids by deciding the ideal membership problem. The aim of this paper is to show in a similar fashion how congruences on monoids and groups can be characterized by ideals in respective monoid and group rings. Th...
متن کاملOn zero divisor graph of unique product monoid rings over Noetherian reversible ring
Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors. The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero zero-divisors of $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$. In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...
متن کاملOn quasi-zero divisor graphs of non-commutative rings
Let $R$ be an associative ring with identity. A ring $R$ is called reversible if $ab=0$, then $ba=0$ for $a,bin R$. The quasi-zero-divisor graph of $R$, denoted by $Gamma^*(R)$ is an undirected graph with all nonzero zero-divisors of $R$ as vertex set and two distinct vertices $x$ and $y$ are adjacent if and only if there exists $0neq rin R setminus (mathrm{ann}(x) cup mathrm{ann}(y))$ such tha...
متن کاملThe effectiveness of learning strategies training in the mathematics’ word problem-solving performance among mentally retarded elementary school students
Objective: The present research aimed to investigate the effectiveness of learning strategies training in the mathematics’ word problem-solving performance among mentally-retarded elementary school students. Method: The research population included all the mentally retarded female students studying in the sixth grade of elementary schools located in Tehran in the school year of 2016, out of whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 32 شماره
صفحات -
تاریخ انتشار 2001