Softcover ISBN:  9780821836187 
Product Code:  CONM/378 
List Price:  $130.00 
MAA Member Price:  $117.00 
AMS Member Price:  $104.00 
eBook ISBN:  9780821879689 
Product Code:  CONM/378.E 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
Softcover ISBN:  9780821836187 
eBook: ISBN:  9780821879689 
Product Code:  CONM/378.B 
List Price:  $255.00 $192.50 
MAA Member Price:  $229.50 $173.25 
AMS Member Price:  $204.00 $154.00 
Softcover ISBN:  9780821836187 
Product Code:  CONM/378 
List Price:  $130.00 
MAA Member Price:  $117.00 
AMS Member Price:  $104.00 
eBook ISBN:  9780821879689 
Product Code:  CONM/378.E 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
Softcover ISBN:  9780821836187 
eBook ISBN:  9780821879689 
Product Code:  CONM/378.B 
List Price:  $255.00 $192.50 
MAA Member Price:  $229.50 $173.25 
AMS Member Price:  $204.00 $154.00 

Book DetailsContemporary MathematicsVolume: 378; 2005; 348 ppMSC: Primary 20; 81; Secondary 68
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.
ReadershipGraduate students and research mathematicians interested in algorithmic and combinatorial group theory.

Table of Contents

Articles

Robert H. Gilman — Formal languages and their application to combinatorial group theory [ MR 2159313 ]

Alexei G. Myasnikov, Vladimir N. Remeslennikov and Denis E. Serbin — Regular free length functions on Lyndon’s free $\Bbb Z[t]$group $F^{\Bbb Z[t]}$ [ MR 2159314 ]

I. M. Chiswell — $A$free groups and treefree groups [ MR 2159315 ]

Olga Kharlampovich and Alexei G. Myasnikov — Effective JSJ decompositions [ MR 2159316 ]

Olga Kharlampovich and Alexei Myasnikov — Algebraic geometry over free groups: lifting solutions into generic points [ MR 2159317 ]

Evgenii S. Esyp, Ilia V. Kazatchkov and Vladimir N. Remeslennikov — Divisibility theory and complexity of algorithms for free partially commutative groups [ MR 2159318 ]


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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.

Articles

Robert H. Gilman — Formal languages and their application to combinatorial group theory [ MR 2159313 ]

Alexei G. Myasnikov, Vladimir N. Remeslennikov and Denis E. Serbin — Regular free length functions on Lyndon’s free $\Bbb Z[t]$group $F^{\Bbb Z[t]}$ [ MR 2159314 ]

I. M. Chiswell — $A$free groups and treefree groups [ MR 2159315 ]

Olga Kharlampovich and Alexei G. Myasnikov — Effective JSJ decompositions [ MR 2159316 ]

Olga Kharlampovich and Alexei Myasnikov — Algebraic geometry over free groups: lifting solutions into generic points [ MR 2159317 ]

Evgenii S. Esyp, Ilia V. Kazatchkov and Vladimir N. Remeslennikov — Divisibility theory and complexity of algorithms for free partially commutative groups [ MR 2159318 ]