03949nam 2200601 450 991081406820332120220823063710.00-8218-8237-6(CKB)3240000000070081(EBL)3113159(SSID)ssj0000629382(PQKBManifestationID)11433181(PQKBTitleCode)TC0000629382(PQKBWorkID)10731690(PQKB)10289832(MiAaPQ)EBC3113159(RPAM)16930429(PPN)197108881(EXLCZ)99324000000007008120110822h20112011 uy| 0engur|n|---|||||txtccrModel theoretic methods in finite combinatorics AMS-ASL Joint Special Session, January 5-8, 2009 Washington, DC /Martin Grohe, Johann A. Makowsky, editorsProvidence, Rhode Island :American Mathematical Society,[2011]©20111 online resource (529 p.)Contemporary mathematics,5580271-4132Description based upon print version of record.0-8218-4943-3 Includes bibliographical references.Contents -- 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 Ï?-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.Contemporary mathematics (American Mathematical Society).5580271-4132Finite model theoryCongressesCombinatorial probabilitiesCongressesFinite model theoryCombinatorial probabilities519.203-0203-0605-0205-0668-0268-06mscGrohe M(Martin),Makowsky Johann A.1948-American Mathematical Society.Association for Symbolic Logic.AMS-ASL Joint Special Session on Model Theoretic Methods in Finite CombinatoricsMiAaPQMiAaPQMiAaPQBOOK9910814068203321Model theoretic methods in finite combinatorics855822UNINA01533nam 2200469zu 450 991100662180332120210807000512.00-8031-7041-61-62870-233-8(CKB)2550000001303406(SSID)ssj0001133255(PQKBManifestationID)12464012(PQKBTitleCode)TC0001133255(PQKBWorkID)11156875(PQKB)10622273(EXLCZ)99255000000130340620160829d2013 uy engtxtccrThe practice of flash point determination: a laboratory resource[Place of publication not identified]ASTM International2013Bibliographic Level Mode of Issuance: Monograph0-8031-7040-8 Flash point (Thermodynamics)Handbooks, manuals, etcFlammable liquidsHandbooks, manuals, etcChemical & Materials EngineeringHILCCEngineering & Applied SciencesHILCCChemical EngineeringHILCCFlash point (Thermodynamics)Flammable liquidsChemical & Materials EngineeringEngineering & Applied SciencesChemical Engineering621.402/1Montemayor Rey GPQKBBOOK9911006621803321The practice of flash point determination: a laboratory resource4389014UNINA