Abstract
In this paper we will consider random graphsG n,p ,p=n −α a rational number between 0 and 1. We show that there is no decision procedure that separates those first order statements that hold almost always inG n,p from those whose negation holds almost always.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Bollobás,Random Graphs (Academic Press, New York, 1985).
H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat. 23 (1952) 493–507.
D. Matula, Expose-and-merge exploration and the chromatic number of a random graph, Combinatorica 7 (1987) 275–284.
E.M. Palmer,Graphical Evolution (Wiley, New York, 1985).
A. Rényi,Probability Theory (Akadémiai Kiadó, Budapest, 1970).
S. Shelah and J. Spencer, Zero-one laws for sparse random graphs, J. Amer. Math. Soc. 1 (1988) 97–115.
J. Spencer,Ten Lectures on the Probabilistic Method (Society for Industrial and Applied Mathematics, Philadelphia, 1987).
B.A. Trachtenbrot, Impossibility of an algorithm for the decision problem on finite classes, Doklady Akad. Nauk. S.S.R. 70 (1950) 569–572.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dolan, P. Undecidable statements and random graphs. Ann Math Artif Intell 6, 17–25 (1992). https://doi.org/10.1007/BF01531021
Issue Date:
DOI: https://doi.org/10.1007/BF01531021