{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":18,"n_cols":5,"rows_kept":18,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910814068203321"]
[null,null,"Titolo",null,"Model theoretic methods in finite combinatorics : AMS-ASL Joint Special Session, January 5-8, 2009 Washington, DC / / Martin Grohe, Johann A. Makowsky, editors"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , [2011]"]
[{"$nulls":4},"©2011"]
[null,null,"ISBN",null,"0-8218-8237-6"]
[null,null,"Descrizione fisica",null,"1 online resource (529 p.)"]
[null,null,"Collana",null,"Contemporary mathematics, ; 558 , 0271-4132"]
[null,null,"Classificazione",null,"03-0203-0605-0205-0668-0268-06"]
[null,null,"Disciplina",null,"519.2"]
[null,null,"Soggetti",null,"Finite model theory"]
[{"$nulls":4},"Combinatorial probabilities"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"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 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 "]
[{"$nulls":4},"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."]