| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910817222703321 |
|
|
Autore |
Cherlin Gregory L. <1948-> |
|
|
Titolo |
The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments / / Gregory L. Cherlin |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Providence, Rhode Island : , : American Mathematical Society, , [1998] |
|
©1998 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (183 p.) |
|
|
|
|
|
|
Collana |
|
Memoirs of the American Mathematical Society, , 0065-9266 ; ; number 621 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
|
|
Soggetti |
|
Directed graphs |
Tournaments (Graph theory) |
Model theory |
Ramsey theory |
Permutation groups |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
"January 1998, volume 131, number 621 (first of 4 numbers)." |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and indexes. |
|
|
|
|
|
|
Nota di contenuto |
|
""Contents""; ""Introduction""; ""Chapter 1. Results and Open Problems""; ""1.1. Homogeneous structures""; ""1.2. A survey of work on homogeneous structures""; ""1.3. Amalgamation classes""; ""1.4. Languages, strong amalgamation, generincation, and Ramsey's theorem""; ""1.5. Classification theorems""; ""1.6. Open problems""; ""Chapter 2. Homogeneous 2-tournaments""; ""2.1. A catalog""; ""2.2. Restricted homogeneous 2-tournaments""; ""2.3. Sources and sinks""; ""2.4. Constrained 2-tournaments""; ""2.5. Unconstrained 2-tournaments""; ""Chapter 3. Homogeneous n-tournaments"" |
""3.1. Introduction""""3.2. Hypercritical and small 3-tournaments""; ""3.3. The critical case""; ""3.4. Two embedding lemmas""; ""3.5. Polarized n-tournaments""; ""3.6. Embedding polarized 3-tournaments""; ""3.7. Some special cases""; ""3.8. The general case""; ""Chapter 4. Homogeneous symmetric graphs""; ""4.1. The theorem of Lachlan and Woodrow""; ""4.2. The main ingredients""; ""4.3. Structure of the proof""; ""4.4. Steps 7, 5, 8. Proof of the Main Theorems""; ""4.5. |
|
|
|
|
|
|
|
|
|
|
Step 1, Proposition 10: adding K(2)""; ""4.6. Step 1, Proposition 11: the operation H[sup(+)]"" |
""7.5. Step 1. Proposition 24: P[sub(3)]""""7.6. Step 1, Proposition 25: adding L(2)""; ""7.7. Step 1, Proposition 26: the operations ±""; ""7.8. Step 1, Propositions 27 and 28: some 1-types""; ""Chapter 8. Theorems 7.6-7.9""; ""8.1. Step 2. Theorems 7.6 and 7.7""; ""8.2. Step 5. Theorem 7.9.T: extending a direct sum""; ""8.3. Step 3. Theorem 7.8, 1-types over sums""; ""8.4. Theorem 7.8, conclusion""; ""Appendix: Examples for richer languages""; ""Bibliography""; ""Index of Notation""; ""Index""; ""A""; ""B""; ""C""; ""D""; ""E""; ""F""; ""G""; ""H""; ""I""; ""J""; ""K""; ""L""; ""M""; ""N"" |
""O"" |
|
|
|
|
|
| |