Table of Contents

Introduction. 1. Review of axiomatic set theory, relation. 2. Coherence lemma, cofinality, tree, ideal. 3. Ramsey theorem, partition, incidence matrix. 4. Good, bad sequence, well partial ordering. 5. Embeddability between relations and chains. 6. Scattered chain, scattered poset. 7. Well quasi-ordering of scattered chains. 8. Bivalent tableau, Szpilrajn chain. 9. Free operator, chainability, strong interval. 10. Age, &agr;-morphism, back-and-forth. 11. Relative isomorphism, saturated relation. 12. Homogeneous relation, orbit. 13. Compatibility and chainability theorems. A. On countable homogeneous systems: Sauer