The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments
Author(s)
Bibliographic Information
The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments
（Memoirs of the American Mathematical Society, no. 621）
American Mathematical Society, 1998
Available at / 19 libraries
-
No Libraries matched.
- Remove all filters.
Note
"January 1998, volume 131, number 621 (first of 4 numbers)"
Includes bibliographical references and indexes
Description and Table of Contents
Description
In this book, Ramsey theoretic methods introduced by Lachlan are applied to classify the countable homogeneous directed graphs. This is an uncountable collection, and this book presents the first explicit classification result covering an uncountable family. The author's aim is to demonstrate the potential of Lachlan's method for systematic use. It features: interface between combinatorics and model theory; unusual use of Ramsey's theorem to classify structures; an extension of an already elaborate branch of model theory; and the first monograph on Lachlan's method.
Table of Contents
Results and open problems Homogeneous $2$-tournaments Homogeneous $n$-tournaments Homogeneous symmetric graphs Homogeneous directed graphs omitting $I_\infty$ Propositions $16$ to $20$ and MT $2.2$ Homogeneous directed graphs embedding $I_\infty$ Theorems 7.6-7.9 Appendix: Examples for richer languages Bibliography Index of Notation Index.
by "Nielsen BookData"
