Over the last 20 years, various new connections between model theory and finite combinatorics have emerged. This volume highlights some of the main results, techniques, and research directions of the area. Topics covered include developments on 0-1 laws and their variations, counting functions defined by homomorphisms and graph polynomials and their relation to logic, recurrences and spectra, the logical complexity of graphs, algorithmic meta theorems based on logic, and logical aspects of Ramsey theory.
| ISBN: | 9780821849439 |
| Publication date: | 30th December 2011 |
| Author: | AMSASL Joint Special Session on Model Theoretic Methods in Finite Combinatorics |
| Publisher: | American Mathematical Society |
| Format: | Paperback |
| Pagination: | 519 pages |
| Series: | Contemporary Mathematics |
| Genres: |
Applied mathematics Discrete mathematics Combinatorics and graph theory |
Over the last 20 years, various new connections between model theory and finite combinatorics have emerged. This volume highlights some of the main results, techniques, and research directions of the area.
Model Theoretic Methods in Finite Combinatorics features in the following genres: Applied mathematics, Discrete mathematics, Combinatorics and graph theory
Paperback. Not Available.
Model Theoretic Methods in Finite Combinatorics was written by AMSASL Joint Special Session on Model Theoretic Methods in Finite Combinatorics and published by American Mathematical Society
Model Theoretic Methods in Finite Combinatorics has 519 pages
Yes it is part of Contemporary Mathematics series