This paper considers two aspects of the word problem for groups: first, some similarities between derivations from the relations of a group and proofs from a set of axioms in logic, and second, the computational difficulty of word problems and the problem of constructing groups with solvable word problems of some preassigned degree of difficulty. Given a presentation of a group in terms of generators and relations, we define two words on the generators to be equal if and only if one can be transformed into the other in a finite number of steps using the relations of the group. Defining equality in a group as derivability from a set of axioms suggests formulating the word problem for a group as the derivability problem for a formal system. The system we choose is equational logic. We show that there exist some striking analogies between results from logic and results about groups: nontrivial groups correspond to consistent systems, groups with solvable word problem to decidable systems, and simple groups to complete systems. This suggests that results about formal systems could be used to obtain results about decidability in groups. A group has word problem in level of the Grzegorczyk hierarchy if the running time of the algorithm solving the word problem is in .G roups having word problem solvable in levels s(n 2) of the Grzegorczyk hierarchy are given. The groups are constructed using a standard procedure of constructing a group given the presentation of a semigroup. Semigroups are constructed following J. Robinson smethod of functional equations: the semigroups are decidable systems of functional equations which define functions in .T his technique for constructing semigroups is particularly elegant, for it has the advantage of exhibiting the semigroup as a concrete system. We show that if the semigroup has word problem ins (and not lower) ,then the result
(Typographical errors above are due to OCR software and don't occur in the book.)
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book explores the fascinating connections between formal systems and the computational complexity of word problems in groups. The author establishes striking analogies between theorems from logic and results about groups, revealing that groups with solvable word problems correspond to decidable systems and simple groups to complete systems. The author investigates the concept of decidability in groups, defining a group as having a word problem in level n of the Grzegorczyk hierarchy if the running time of the algorithm solving the word problem is in 8n. A significant contribution of this book is the construction of finitely presented groups with word problems in 8n (n ⥠2). This is achieved by utilizing a technique for constructing semigroups following J. Robinson's method of functional equations, which provides a concrete representation of the groups. The author demonstrates that if a semigroup has a word problem in 8n (and not lower), then the resulting group also has a word problem in 8n (and not lower). The insights presented in this book not only contribute to the understanding of word problems in groups but also shed light on the relationship between formal systems and decidability, offering valuable perspectives for further research and applications in computer science and mathematics. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781330197349_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781330197349
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781330197349
Quantité disponible : 15 disponible(s)