Infinitary logics and very sparse random graphs

Journal of Symbolic Logic

Volumn 62, Issue 2, 1997, Pages 609-623

  Lynch, James F ^a  

^a CLARKSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031480811     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275550     Document Type: Article

References (20)

1. T. BEHRENDT, K. COMPTON, and E. GRÄDEL, Optimization problems: expressibilily, approximation properties and expected asymptotic growth of optimal solutions, Proc. conf. on computer science logic, Springer-Verlag, New York, 1993.
2. R. W. BUTLER and G. B. FINELLI, The infeasability of experimental quantification of life-critical software reliability, Software Engineering Notes, vol. 16 (1991), pp. 66-76.
3. A. CHANDRA and D. HAREL, Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99-128.
4. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat., vol. 23 (1952), pp. 493-507.
5. K. J. COMPTON and C. RAVISHANKAR, Expected deadlock time in a multiprocessing system, Journal of the ACM, vol. 42 (1995), pp. 562-583.
6. P. ERDÖS and A. RÉNYI, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., vol. 5 (1960), pp. 17-61.
7. R. FAGIN, Probabilities on finite models, this JOURNAL, vol. 41 (1976), pp. 50-58.
8. P. FLAJOLET, D. E. KNUTH, and B. PITTEL, The first cycles in an evolving graph, Discrete Mathematics, vol. 75 (1989), pp. 167-215.
9. Y. V. GLEBSKIǏ, D. I. KOGAN, M. I. LIOGON'KIǏ, and V. A. TALANOV, Range and degree of readability of formulas in the restricted predicate calculus, Kibernetika (Kiev), vol. 2 (1969), pp. 17-28, English translation, Cybernetics, vol. 5 (1972), pp. 142-154.
10. Y. V. GLEBSKIǏ, D. I. KOGAN, M. I. LIOGON'KIǏ, and V. A. TALANOV, Range and degree of readability of formulas in the restricted predicate calculus, Kibernetika (Kiev), vol. 2 (1969), pp. 17-28, English translation, Cybernetics, vol. 5 (1972), pp. 142-154.
11. Y. GUREVICH, Zero-one laws, Bulletin of the EATCS, vol. 46 (1992), pp. 90-106.
12. PH. G. KOLAITIS, On asymptotic probabilities of inductive queries and their decision problem, Logics of programs '85 (R. Parikh, editor), Lecture Notes in Computer Science, vol. 193, Springer-Verlag, 1985, pp. 153-166.
13. PH. G. KOLAITIS and M. Y. VARDI, Infinitary logics and 0-1 laws, Information and Computation, vol. 98 (1992), pp. 258-294.
14. J. F. LYNCH, Probabilities of first-order sentences about unary functions, Transactions of the American Mathematical Society, vol. 287 (1985), pp. 543-568.
15. _, Probabilities of sentences about very sparse random graphs, Random Structures and Algorithms, vol. 3 (1992), pp. 33-53.
16. _, An extension of 0-1 laws, Random Structures and Algorithms, vol. 5 (1994), pp. 155-172.
17. _, Random resource allocation graphs and the probability of deadlock, SIAM Journal on Discrete Mathematics, vol. 7 (1994), pp. 458-473.
18. A. RUCIŃSKI and A. VINCE, Strongly balanced graphs and random graphs, Journal of Graph Theory, vol. 10 (1986), pp. 251-264.
19. S. SHELAH and J. SPENCER, Zero-one laws for sparse random graphs, Journal of the American Mathematical Society, vol. 1 (1988), pp. 97-115.
20. J. TYSZKIEWICZ, Infinitary queries and their asymptotic probabilities. I. Properties definable in transitive closure logic, Proceedings of Computer Science Logic '91 (E. Börger et al., editors), Lecture Notes in Computer Science, vol. 626, Springer-Verlag, 1991, pp. 396-410.