The reconstruction of trees from their automorphism groups
Author(s)
Bibliographic Information
The reconstruction of trees from their automorphism groups
（Contemporary mathematics, v. 151）
American Mathematical Society, c1993
Available at / 54 libraries
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
dc20:511/r8242070272990
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliography (p. 251-252) and list of notations and definitions
Description and Table of Contents
Description
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.
Table of Contents
An extended introduction Some preliminaries concerning interpretations, groups and $\aleph_0$-categoricity A new reconstruction theorem for Boolean algebras The completion and the Boolean algebra of a U-tree The statement of the canonization and reconstruction theorems The canonization of trees The reconstruction of the Boolean algebra of a U-tree The reconstruction of $PT({\mathrm Exp}(M))$ Final reconstruction results Observations, examples and discussion Augmented trees The reconstruction of $\aleph_0$-categorical trees Nonisomorphic 1-homogeneous chains which have isomorphic automorphism groups Bibliography A list of notations and definitions.
by "Nielsen BookData"