## Theory of RelationsRelation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by Dushnik, Miller 1940 who, starting from the chain of reals, obtained an infinite strictly decreasing sequence of chains (of continuum power) with respect to embeddability. In 1948 I conjectured that every strictly decreasing sequence of denumerable chains is finite. This was affirmatively proved by Laver (1968), in the more general case of denumerable unions of scattered chains (ie: which do not embed the chain Q of rationals), by using the barrier and the better orderin gof Nash-Williams (1965 to 68). Another important problem is the extension to posets of classical properties of chains. For instance one easily sees that a chain A is scattered if the chain of inclusion of its initial intervals is itself scattered (6.1.4). Let us again define a scattered poset A by the non-embedding of Q in A. We say that A is finitely free if every antichain restriction of A is finite (antichain = set of mutually incomparable elements of the base). In 1969 Bonnet and Pouzet proved that a poset A is finitely free and scattered iff the ordering of inclusion of initial intervals of A is scattered. In 1981 Pouzet proved the equivalence with the a priori stronger condition that A is topologically scattered: (see 6.7.4; a more general result is due to Mislove 1984); ie: every non-empty set of initial intervals contains an isolated elements for the simple convergence topology. In chapter 9 we begin the general theory of relations, with the notions of local isomorphism, free interpretability and free operator (9.1 to 9.3), which is the relationist version of a free logical formula. This is generalized by the back-and-forth notions in 10.10: the (k,p)-operator is the relationist version of the elementary formula (first order formula with equality). Chapter 12 connects relation theory with permutations: theorem of the increasing number of orbits (Livingstone, Wagner in 12.4). Also in this chapter homogeneity is introduced, then more deeply studied in the Appendix written by Norbert Saucer. Chapter 13 connects relation theory with finite permutation groups; the main notions and results are due to Frasnay. Also mention the extension to relations of adjacent elements, by Hodges, Lachlan, Shelah who by this mean give an exact calculus of the reduction threshold. The book covers almost all present knowledge in Relation Theory, from origins (Hausdorff 1914, Sierpinski 1928) to classical results (Frasnay 1965, Laver 1968, Pouzet 1981) until recent important publications (Abraham, Bonnet 1999). All results are exposed in axiomatic set theory. This allows us, for each statement, to specify if it is proved only from ZF axioms of choice, the continuum hypothesis or only the ultrafilter axiom or the axiom of dependent choice, for instance. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

13 | |

43 | |

Chapter 3 Ramsey theorem partition incidence matrix | 79 |

Chapter 4 Good bad sequence well partial ordering | 109 |

Chapter 5Embeddability between relations and chains | 143 |

Chapter 6 Scattered chain scattered poset | 167 |

Chapter 7 Well quasiordering of scattered chains | 195 |

Chapter 8 Bivalent tableau Szpilrajn chain | 223 |

Chapter 9 Free operator chainability strong interval | 241 |

Chapter 10 Age αmorphism backandforth | 273 |

Chapter 11 Relative isomorphism saturated relation | 305 |

Chapter 12 Homogeneous relation orbit | 331 |

Chapter 13 Compatibility and chainability theorems | 351 |

Sauer | 387 |

### Other editions - View all

### Common terms and phrases

admits an embedding aleph amalgamable arbitrary arity associate augmentation automorphism axiom of choice bad sequence belongs better partial ordering bijection binary relation bound cardinality chainable clopen set cofinal color common extension continuum hypothesis contradiction countable ordinal couple defined denote denumerable dependent choice disjoint domain equimorphic equipotent equivalence classes equivalence relation example final interval finite relations finite set finite subset finitely free Given graph hence homogeneous relational system hypergraph identity iff there exists included indecomposable indecomposable chain infinite set initial interval integer intersection isomorphism lemma Let F m-ary maximum minimal bad modulo multirelation mutually incomparable n-ary relation n-tuple non-empty obtain orbit p-element subsets pairs partition permutation poset POUZET preceding proposition Rado graph respect to embeddability satisfies scattered chain set of integers singleton strictly increasing strictly less subpotent subset F successor ordinal Suppose theorem totally ordered ultrafilter ultrafilter axiom unary union w-sequence well-founded poset well-ordering ZF suffices

### Popular passages

Page 421 - R. (1982). La zérologie, une recherche aux frontières de la logique et de l'art: application à la logique des relations de base vide. International Logic Review 26.

Page 18 - A set a is totally ordered (by membership relation) iff, for every x, y € a, either x € y or y € x or x = y.

Page 421 - FRAENKEL 1925 - Untersuchungen iiber die Grundlagen der Mengenlehre. Math. Zeitschrift vol. 22 p.250-273.