AMS Bookstore LOGO amslogo
Return to List

AMS TextbooksAMS Applications-related Books

Groups, Languages, Algorithms
Edited by: Alexandre V. Borovik, University of Manchester, UK

Contemporary Mathematics
2005; 348 pp; softcover
Volume: 378
ISBN-10: 0-8218-3618-8
ISBN-13: 978-0-8218-3618-7
List Price: US$103
Member Price: US$82.40
Order Code: CONM/378
[Add Item]

Request Permissions

Since the pioneering works of Novikov and Maltsev, group theory has been a testing ground for mathematical logic in its many manifestations, from the theory of algorithms to model theory. The interaction between logic and group theory led to many prominent results which enriched both disciplines.

This volume reflects the major themes of the American Mathematical Society/Association for Symbolic Logic Joint Special Session (Baltimore, MD), Interactions between Logic, Group Theory and Computer Science. Included are papers devoted to the development of techniques used for the interaction of group theory and logic. It is suitable for graduate students and researchers interested in algorithmic and combinatorial group theory.

A complement to this work is Volume 349 in the AMS series, Contemporary Mathematics, Computational and Experimental Group Theory, which arose from the same meeting and concentrates on the interaction of group theory and computer science.


Graduate students and research mathematicians interested in algorithmic and combinatorial group theory.

Table of Contents

  • R. H. Gilman -- Formal languages and their application to combinatorial group theory
  • A. G. Myasnikov, V. N. Remeslennikov, and D. E. Serbin -- Regular free length functions on Lyndon's free \(\mathbb{Z}[t]\)-group \(F^{\mathbb{Z}[t]}\)
  • I. Chiswell -- \(A\)-free groups and tree-free groups
  • O. Kharlampovich and A. G. Myasnikov -- Effective JSJ decompositions
  • O. Kharlampovich and A. Myasnikov -- Algebraic geometry over free groups: Lifting solutions into generic points
  • E. S. Esyp, I. V. Kazatchkov, and V. N. Remeslennikov -- Divisibility theory and complexity of algorithms for free partially commutative groups
Powered by MathJax

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia