1989/08/17 by Daniel E. Cohen · 2 citations
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Mathematical proof #Mathematics #Group (periodic table) #Embedding #Topological group #Computability #Discrete mathematics #Pure mathematics #Algebra over a field #Computer science #Combinatorics #Topology (electrical circuits) #Artificial intelligence
paper · doi:10.1017/cbo9780511565878
openalex publication_date 1989/08/17 · openalex created_date 2016/06/24 · openalex updated_date 2026/04/04
In this book, developed from courses taught at the University of London, the author aims to show the value of using topological methods in combinatorial group theory. The topological material is given in terms of the fundamental groupoid, giving results and proofs that are both stronger and simpler than the traditional ones. Several chapters deal with covering spaces and complexes, an important method, which is then applied to yield the major Schreier and Kurosh subgroup theorems. The author presents a full account of Bass-Serre theory and discusses the word problem, in particular, its unsolvability and the Higman Embedding Theorem. Included for completeness are the relevant results of computability theory.