LEADER 03949nam 2200601 450 001 9910814068203321 005 20220823063710.0 010 $a0-8218-8237-6 035 $a(CKB)3240000000070081 035 $a(EBL)3113159 035 $a(SSID)ssj0000629382 035 $a(PQKBManifestationID)11433181 035 $a(PQKBTitleCode)TC0000629382 035 $a(PQKBWorkID)10731690 035 $a(PQKB)10289832 035 $a(MiAaPQ)EBC3113159 035 $a(RPAM)16930429 035 $a(PPN)197108881 035 $a(EXLCZ)993240000000070081 100 $a20110822h20112011 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aModel theoretic methods in finite combinatorics $eAMS-ASL Joint Special Session, January 5-8, 2009 Washington, DC /$fMartin Grohe, Johann A. Makowsky, editors 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[2011] 210 4$dİ2011 215 $a1 online resource (529 p.) 225 1 $aContemporary mathematics,$v558$x0271-4132 300 $aDescription based upon print version of record. 311 $a0-8218-4943-3 320 $aIncludes bibliographical references. 327 $aContents -- Preface -- Application of Logic to Combinatorial Sequences and Their Recurrence Relations -- Part 1. Introduction and Synopsis -- 1. Sequences of integers and their combinatorial interpretations -- 2. Linear recurrences -- 3. Logical formalisms -- 4. Finiteness conditions -- 5. Logical interpretations of integer sequences -- Part 2. Guiding Examples -- 6. The classical recurrence relations -- 7. Functions, permutations and partitions -- 8. Trees and forests -- 9. Graph properties -- 10. Latin squares -- Part 3. C-Finite and Holonomic Sequences -- 2.2. A length-depth relation -- 2.3. Distinguishability vs. definability -- 3. Ehrenfeucht games -- 4. The Weisfeiler-Lehman algorithm -- 5. Worst case bounds -- 5.1. Classes of graphs -- 5.2. General case -- 6. Average case bounds -- Methods for Algorithmic Meta Theorems -- On Counting Generalized Colorings -- 1. Introduction -- 2. Prelude: two typical graph polynomials -- 3. Counting generalized colorings -- 4. SOL-polynomials and subset expansion -- 5. Standard vs FF vs Newton SOL-polynomials -- 6. Equivalence of counting I??-colorings and SOL-polynomials -- 7. MSOL-polynomials -- 8. Enter categoricity -- 9. Conclusions -- References -- Counting Homomorphisms and Partition Functions -- Some Examples of Universal and Generic Partial Orders -- Two Problems on Homogeneous Structures, Revisited -- On Symmetric Indivisibility of Countable Structures -- Partitions and Permutation Groups -- (Un)countable and (Non)effective Versions of Ramsey's Theorem -- Reducts of Ramsey Structures -- 1. Introduction -- 2. Reducts -- 3. Ramsey Classes -- 4. Topological Dynamics -- 5. Minimal Functions -- 6. Decidability of Definability -- 7. Interpretability -- 8. Complexity of Constraint Satisfaction -- 9. Concluding Remarks and Further Directions -- References. 410 0$aContemporary mathematics (American Mathematical Society).$v558$x0271-4132 606 $aFinite model theory$vCongresses 606 $aCombinatorial probabilities$vCongresses 615 0$aFinite model theory 615 0$aCombinatorial probabilities 676 $a519.2 686 $a03-02$a03-06$a05-02$a05-06$a68-02$a68-06$2msc 702 $aGrohe$b M$g(Martin), 702 $aMakowsky$b Johann A.$f1948- 712 02$aAmerican Mathematical Society. 712 02$aAssociation for Symbolic Logic. 712 12$aAMS-ASL Joint Special Session on Model Theoretic Methods in Finite Combinatorics 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910814068203321 996 $aModel theoretic methods in finite combinatorics$9855822 997 $aUNINA