1992/01/01 by James F. Lynch · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #semigroups and automata theory #Algorithms and Data Compression
paper · doi:10.1002/rsa.3240030105
openalex publication_date 1992/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
Abstract We consider random graphs with edge probability β n −α , where n is the number of vertices of the graph, β > 0 is fixed, and α = 1 or α = ( l + 1) / l for some fixed positive integer l . We prove that for every first‐order sentence, the probability that the sentence is true for the random graph has an asymptotic limit.