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.
KeywordsRandom Graph Circuit Complexity Finite Graph Existential Quantifier Longe Hold
Unable to display preview. Download preview PDF.