Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer. (Q1591661)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer. |
scientific article |
Statements
Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer. (English)
0 references
7 January 2001
0 references
This book is a revision of the original edition (1986; Zbl 0593.04001). In addition it also treats the more recent developments in this area. In an introductory chapter a rather detailed review of axiomatic set theory is given, in which for most theorems also the proofs are worked out or at least sketched. Then the fundamental notions of order theory are introduced, and subsequenty a lot of concepts and theorems from the partition calculus of set theory, which later are used as tools. The chapters 4-8 are mainly devoted to order relations. Among others the following concepts are discussed: cofinality (for linearly and partially ordered sets), well partial ordering, dimension theory for posets, embeddability between relations and chains, trees, scattered chains and scattered posets, well-quasi-ordering of scattered chains, barriers. The chapters 9-13 deal mostly with more general relational systems. Among others the notions of age, \(\alpha\)-morphism, relative isomorphism, saturated relation, homogeneous relation, orbit, compatibility and chainability theorems are treated. An appendix on countable homogeneous systems by N. Sauer follows. The book has an extensive bibliography (253 items) and includes many exercises. The text is concise but well comprehensible. Reviewers remark: The theorem in 4.9.4 was first mentioned in a paper by the reviewer [Math. Nachr. 46, 183-188 (1970; Zbl 0175.01201)]. In the last line of p. 66 the comparison graph of the neighbor-relation, not that of \(<\), should be taken. p. 54, line 16: replace ``least'' by ``last''; p. 146 line 13 from below, replace \(a\) by \(c\); p. 147, in lines 20, 23, 26 replace the first \(\in\) by \(\not\in\).
0 references
axiomatic set theory
0 references
order theory
0 references
partition calculus
0 references
order relations
0 references
cofinality
0 references
ordered sets
0 references
chains
0 references
trees
0 references
posets
0 references
relational systems
0 references
age
0 references
orbit
0 references