Convergence Laws for Random Graphs

[1]  S. Shelah.  Very weak zero one law for random graphs with order and random binary functions , 1996, Random Struct. Algorithms.

[2]  Jerzy Tyszkiewicz,et al.  The infinitary logic of sparse random graphs , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[3]  James F. Lynch.  An Extension of 0-1 Laws , 1994, Random Struct. Algorithms.

[4]  James F. Lynch.  Infinitary logics and very sparse random graphs , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[5]  Peter Dolan,et al.  The Logic of Ordered Random Structures , 1993, Random Struct. Algorithms.

[6]  Serge Abiteboul,et al.  Queries are easier than you thought (probably) , 1992, PODS '92.

[7]  Phokion G. Kolaitis,et al.  Infinitary Logics and 0-1 Laws , 1992, Inf. Comput..

[8]  Jerzy Tyszkiewicz.  Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic , 1991, CSL.

[9]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[10]  J. Tyszkiewicz.  Innnitary Queries and Their Asymptotic Probabilities I: Properties Deenable in Transitive Closure Logic , 1991 .

[11]  James F. Lynch,et al.  Probabilities of sentences about very sparse random graphs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[13]  Saharon Shelah,et al.  Nonconvergence, undecidability, and intractability in asymptotic problems , 1987, Ann. Pure Appl. Log..

[14]  Andreas Blass,et al.  A Zero-One Law for Logic with a Fixed-Point Operator , 1986, Inf. Control..

[15]  Phokion G. Kolaitis.  On Asymptotic Probability of Inductive Queries and Their Decision Problem , 1985, Logic of Programs.

[16]  J. Lynch.  Probabilities of first-order sentences about unary functions , 1985 .

[17]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

[19]  K. Jon Barwise,et al.  On Moschovakis closure ordinals , 1977, Journal of Symbolic Logic.

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

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

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