Skip to main content
Log in

Ups and Downs of First Order Sentences on Random Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

whenever is a fixed positive irrational. This raises the question what zero-one valued functions on the positive irrationals arise as the limit probability of a first order sentence on these graphs. Here we prove two necessary conditions on these functions, a number-theoretic and a complexity condition. We hope to prove in a subsequent paper that these conditions together with two simpler and previously proved conditions are also sufficient and thus they constitute a characterization.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received October 2, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spencer, J., Tardos, G. Ups and Downs of First Order Sentences on Random Graphs. Combinatorica 20, 263–280 (2000). https://doi.org/10.1007/s004930070025

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930070025

Navigation