| Hardcover ISBN: | 978-0-8218-0578-7 |
| Product Code: | DIMACS/33 |
| 130 pp | |
| List Price: | $41.00 |
| MAA Member Price: | $36.90 |
| AMS Member Price: | $32.80 |
| Electronic ISBN: | 978-1-4704-3991-0 |
| Product Code: | DIMACS/33.E |
| 130 pp | |
| List Price: | $38.00 |
| MAA Member Price: | $34.20 |
| AMS Member Price: | $30.40 |
-
Book DetailsDIMACS - Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 33; 1997MSC: Primary 03; 05;
This volume contains selected papers from the DIMACS Workshop on Logic and Random Structures held in November 1995. The workshop was a major event of the DIMACS Special Year on Logic and Algorithms. The central theme was the relationship between logic and probabilistic techniques in the study of finite structures.
In the last several years, this subject has developed into a very active area of mathematical logic with important connections to computer science. The DIMACS workshop was the first of its kind devoted to logic and random structures. Recent work of leaders in the field is contained in the volume, as well as new theoretical developments and applications to computer science.ReadershipGraduate students and research mathematicians interested in combinatorics, computer science, logic, and probability.
-
Table of Contents
-
Chapters
-
Near model completeness and 0-1 laws
-
Smoothness laws for random ordered graphs
-
Spectrally determined first-order limit laws
-
The asymptotic behavior of ${L^k_{\infty ,\omega }}$ on sparse random graphs
-
$k$-universal finite graphs
-
Monadic second order probabilities in algebra. Directly representable varieties and groups
-
Approximating the structures accepted by a constant depth circuit or satisfying a sentence - a nonstandard approach
-
-
Request Review Copy
- Book Details
- Table of Contents
-
- Request Review Copy
This volume contains selected papers from the DIMACS Workshop on Logic and Random Structures held in November 1995. The workshop was a major event of the DIMACS Special Year on Logic and Algorithms. The central theme was the relationship between logic and probabilistic techniques in the study of finite structures.
In the last several years, this subject has developed into a very active area of mathematical logic with important connections to computer science. The DIMACS workshop was the first of its kind devoted to logic and random structures. Recent work of leaders in the field is contained in the volume, as well as new theoretical developments and applications to computer science.
Graduate students and research mathematicians interested in combinatorics, computer science, logic, and probability.
-
Chapters
-
Near model completeness and 0-1 laws
-
Smoothness laws for random ordered graphs
-
Spectrally determined first-order limit laws
-
The asymptotic behavior of ${L^k_{\infty ,\omega }}$ on sparse random graphs
-
$k$-universal finite graphs
-
Monadic second order probabilities in algebra. Directly representable varieties and groups
-
Approximating the structures accepted by a constant depth circuit or satisfying a sentence - a nonstandard approach
