The reconstruction of trees from their automorphism groups

Trees, sometimes called semilinear orders, are partially ordered sets in which every initial segment determined by an element is linearly ordered. This book focuses on automorphism groups of trees, providing a nearly complete analysis of when two trees have isomorphic automorphism groups. Special attention is paid to the class of \aleph _0-categorical trees, and for this class the analysis is complete. Various open problems, mostly in permutation group theory and in model theory, are discussed, and a number of research directions are indicated. Aimed at graduate students and researchers in model theory and permutation group theory, this self-contained book will bring readers to the forefront of research on this topic.