Stronger Logics

  • Joel Spencer
Part of the Algorithms and Combinatorics book series (AC, volume 22)


What happens if we increase the power of the first order language of graphs? The examples of this chapter show that, in many cases, the Zero-One Laws no longer hold. We shall only consider the basic case p = ½. Even there relatively simple expansions of the language allow for sentences with no limiting probability.


Random Graph Circuit Complexity Finite Graph Existential Quantifier Longe Hold 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Joel Spencer
    • 1
  1. 1.Courant InstituteNew York UniversityNew YorkUSA

Personalised recommendations