论文信息 - A Zero-One Law for Random Subset

A Zero-One Law for Random Subset

We consider first order sentences about two logical structures. First we consider 1,…, n with the successor relation and a random unary relation that points satisfy with probability p(n). We then replace the successor relation with less than. For both structures we characterize those p(n) for which a zero-one law holds. © 1991 Wiley Periodicals, Inc.

Peter Dolan

[1] K. Compton. Laws in Logic and Combinatorics , 1989 .

[2] Joel H. Spencer,et al. Threshold spectra via the Ehrenfeucht game , 1991, Discret. Appl. Math..

[3] B. Bollobás. The evolution of random graphs , 1984 .

[4] J. Lynch. Almost sure theories , 1980 .

[5] Yu. V. Glebskii,et al. Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .

[6] Ronald Fagin,et al. Probabilities on finite models , 1976, Journal of Symbolic Logic.

[7] J. Spencer,et al. Zero-one laws for sparse random graphs , 1988 .

[8] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.

[9] A. Ehrenfeucht. An application of games to the completeness problem for formalized theories , 1961 .