AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Model Theoretic Methods in Finite Combinatorics
Edited by: Martin Grohe, Humboldt-Universität zu Berlin, Germany, and Johann A. Makowsky, Technion-Israel Institute of Technology, Haifa, Israel
cover
SEARCH THIS BOOK:

Contemporary Mathematics
2011; 519 pp; softcover
Volume: 558
ISBN-10: 0-8218-4943-3
ISBN-13: 978-0-8218-4943-9
List Price: US$145
Member Price: US$116
Order Code: CONM/558
[Add Item]

This volume contains the proceedings of the AMS-ASL Special Session on Model Theoretic Methods in Finite Combinatorics, held January 5-8, 2009, in Washington, DC.

Over the last 20 years, various new connections between model theory and finite combinatorics emerged. The best known of these are in the area of 0-1 laws, but in recent years other very promising interactions between model theory and combinatorics have been developed in areas such as extremal combinatorics and graph limits, graph polynomials, homomorphism functions and related counting functions, and discrete algorithms, touching the boundaries of computer science and statistical physics.

This volume highlights some of the main results, techniques, and research directions of the area. Topics covered in this volume include recent 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, universal and homogeneous structures, and logical aspects of Ramsey theory.

Readership

Graduate students and research mathematicians interested in logic, combinatorics, and theoretical computer science.

Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments: webmaster@ams.org
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia