Hardcover ISBN:  9780821805787 
Product Code:  DIMACS/33 
List Price:  $44.00 
MAA Member Price:  $39.60 
AMS Member Price:  $35.20 
eBook ISBN:  9781470439910 
Product Code:  DIMACS/33.E 
List Price:  $40.00 
MAA Member Price:  $36.00 
AMS Member Price:  $32.00 
Hardcover ISBN:  9780821805787 
eBook: ISBN:  9781470439910 
Product Code:  DIMACS/33.B 
List Price:  $84.00 $64.00 
MAA Member Price:  $75.60 $57.60 
AMS Member Price:  $67.20 $51.20 
Hardcover ISBN:  9780821805787 
Product Code:  DIMACS/33 
List Price:  $44.00 
MAA Member Price:  $39.60 
AMS Member Price:  $35.20 
eBook ISBN:  9781470439910 
Product Code:  DIMACS/33.E 
List Price:  $40.00 
MAA Member Price:  $36.00 
AMS Member Price:  $32.00 
Hardcover ISBN:  9780821805787 
eBook ISBN:  9781470439910 
Product Code:  DIMACS/33.B 
List Price:  $84.00 $64.00 
MAA Member Price:  $75.60 $57.60 
AMS Member Price:  $67.20 $51.20 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 33; 1997; 130 ppMSC: 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipGraduate students and research mathematicians interested in combinatorics, computer science, logic, and probability.

Table of Contents

Chapters

Near model completeness and 01 laws

Smoothness laws for random ordered graphs

Spectrally determined firstorder 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


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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 1–7 were copublished with the Association for Computer Machinery (ACM).
Graduate students and research mathematicians interested in combinatorics, computer science, logic, and probability.

Chapters

Near model completeness and 01 laws

Smoothness laws for random ordered graphs

Spectrally determined firstorder 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