LEADER 03825nam  2200661   450 
001 9910817222703321
005 20180613001300.0
010   $a1-4704-0210-6
035   $a(CKB)3360000000464805
035   $a(EBL)3114567
035   $a(SSID)ssj0000888823
035   $a(PQKBManifestationID)11932376
035   $a(PQKBTitleCode)TC0000888823
035   $a(PQKBWorkID)10866082
035   $a(PQKB)11728953
035   $a(MiAaPQ)EBC3114567
035   $a(RPAM)4490303
035   $a(PPN)195415051
035   $a(EXLCZ)993360000000464805
100   $a19970908h19981998  uy|            0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 14$aThe classification of countable homogeneous directed graphs and countable homogeneous n-tournaments /$fGregory L. Cherlin
210  1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[1998]
210  4$d©1998
215   $a1 online resource (183 p.)
225 1 $aMemoirs of the American Mathematical Society,$x0065-9266 ;$vnumber 621
300   $a"January 1998, volume 131, number 621 (first of 4 numbers)."
311   $a0-8218-0836-2 
320   $aIncludes bibliographical references and indexes.
327   $a""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""
327   $a""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(+)]""
327   $a""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 A?±""; ""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""
327   $a""O""
410  0$aMemoirs of the American Mathematical Society ;$vno. 621.
606   $aDirected graphs
606   $aTournaments (Graph theory)
606   $aModel theory
606   $aRamsey theory
606   $aPermutation groups
615  0$aDirected graphs.
615  0$aTournaments (Graph theory)
615  0$aModel theory.
615  0$aRamsey theory.
615  0$aPermutation groups.
676   $a510 s
676   $a511/.5
700   $aCherlin$b Gregory L.$f1948-$01118785
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910817222703321
996   $aThe classification of countable homogeneous directed graphs and countable homogeneous n-tournaments$93981874
997   $aUNINA