DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1997; 130 pp; hardcover Volume: 33 ISBN10: 0821805789 ISBN13: 9780821805787 List Price: US$36 Member Price: US$28.80 Order Code: DIMACS/33
 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. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Graduate students and research mathematicians interested in combinatorics, computer science, logic, and probability. Table of Contents  J. T. Baldwin  Near model completeness and 01 laws
 R. B. Boppana and J. H. Spencer  Smoothness laws for random ordered graphs
 S. Burris  Spectrally determined firstorder limit laws
 M. McArthur  The asymptotic behavior of \(L^k_{\infty,\omega}\) on sparse random graphs
 E. Rosen, S. Shelah, and S. Weinstein  \(k\)universal finite graphs
 P. M. Idziak and J. Tyszkiewicz  Monadic second order probabilities in algebra. Directly representable varieties and groups
 A. R. Woods  Approximating the structures accepted by a constant depth circuit or satisfying a sentencea nonstandard approach
