A Variety with Solvable, but Not Uniformly Solvable, Word Problem
نویسندگان
چکیده
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the algebra so presented. A variety is given with finitely many axioms having a decidable, but not uniformly decidable, word problem. Other related examples are given as well.
منابع مشابه
Designing Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملSolvable Lie algebras with $N(R_n,m,r)$ nilradical
In this paper, we classify the indecomposable non-nilpotent solvable Lie algebras with $N(R_n,m,r)$ nilradical,by using the derivation algebra and the automorphism group of $N(R_n,m,r)$.We also prove that these solvable Lie algebras are complete and unique, up to isomorphism.
متن کاملA Finitely Axiomatizable Undecidable Equational Theory with Recursively Solvable Word Problems
In this paper we construct a finitely based variety, whose equational theory is undecidable, yet whose word problems are recursively solvable, which solves a problem stated by G. McNulty (1992). The construction produces a discriminator variety with the aforementioned properties starting from a class of structures in some multisorted language (which may include relations), axiomatized by a fini...
متن کاملNILPOTENCY AND SOLUBILITY OF GROUPS RELATIVE TO AN AUTOMORPHISM
In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...
متن کاملHomological Decision Problems for Finitely Generated Groups with Solvable Word Problem
We show that for finitely generated groups G with solvable word problem, there is no algorithm to determine whether H1(G) is trivial, nor whether H2(G) is trivial.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993