Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (2001). Stronger Logics. In: The Strange Logic of Random Graphs. Algorithms and Combinatorics, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04538-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-04538-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07499-8
Online ISBN: 978-3-662-04538-1
eBook Packages: Springer Book Archive