Coloring rules for finite trees, and probabilities of monadic second order sentences

Random Structures and Algorithms

Volumn 10, Issue 4, 1997, Pages 453-485

  Woods, Alan R ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031475943     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199707)10:4<453::AID-RSA3>3.0.CO;2-T     Document Type: Article

References (38)

1. K. J. Compton, Application of a Tauberian theorem to finite model theory, Arch. Math. Logik Grundlag, 25, 91-98 (1985).
2. K. J. Compton, A logical approach to asymptotic combinatorics I: first order properties, Adv. Math., 65, 65-96 (1987).
3. K. J. Compton, A logical approach to asymptotic combinatorics II: monadic second-order properties, J. Combinat. Theor. Ser. A, 50, 110-131 (1989).
4. K. J. Compton and C. W. Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, Ann. Pure Appl. Logic, 48, 1-79 (1990).
5. K. J. Compton, C. W. Henson, and S. Shelah, Nonconvergence, undecidability, and intractability in asymptotic problems, Ann. Pure Appl. Logic, 36, 207-224 (1987).
6. R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, On the Lambert W function, Adv. Comput. Math., to appear.
7. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math., 49, 129-141 (1961).
8. R. Fagin, Probabilities on finite models, J. Symbolic Logic, 41, 50-58 (1976).
9. J. M. Foy, Probability and enumeration results in the theory of finite models, Ph.D. thesis, Yale University, New Haven, CT, 1994.
10. R. Fraïssé, Sur quelques classifications des systèmes de relations, Pub. Sci. Univ. Alger. Ser. A., 1, 35-182 (1954).
11. I. M. Gessel, A combinatorial proof of the multivariable Lagrange inversion formula, J. Combinat. Theor. Ser. A, 45, 178-195 (1987).
12. Y. V. Glebskiǐ, D. I. Kogan, M. I. Liogon'kiǐ, and V. A. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Kibernetika (Kiev), 5(2), 17-28 (1969) [Engl. transl. Cybernetics, 5, 142-154 (1972)].
13. Y. V. Glebskiǐ, D. I. Kogan, M. I. Liogon'kiǐ, and V. A. Talanov, Range and degree of realizability of formulas in the restricted predicate calculus, Kibernetika (Kiev), 5(2), 17-28 (1969) [Engl. transl. Cybernetics, 5, 142-154 (1972)].
14. I. J. Good, The generalization of Lagrange's expansion and the enumeration of trees, Proc. Cambridge Philo. Soc., 61, 499-517 (1965); Correction ibid., 64, 489 (1968).
15. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
16. F. Harary and E. M. Palmer, Graphical Enumeration, Academic, New York, 1973.
17. L. Hörmander, An Introduction to Complex Analysis in Several Variables, North-Holland, Amsterdam, 1990.
18. M. Kaufmann, A counterexample to the 0-1 law for existential monadic second-order logic, CLI Internal Note 32, Computational Logic Inc., Austin, TX, 1987.
19. M. Kaufmann and S. Shelah, On random models of finite power and monadic logic, Discrete Math., 54, 285-293 (1985).
20. H. Lefmann and P. Savický, Some typical properties of large AND/OR Boolean formulas, Proc. MFCS'95, Lecture Notes in Computer Science 969, 1995, pp. 237-246.
21. T. Łuczak and L. Thoma, Convergence of probabilities for the second order monadic properties of a random mapping, preprint, 1996.
22. J. F. Lynch, Probabilities of first-order sentences about unary functions, Trans. Am. Math. Soc., 287, 543-568 (1985).
23. G. L. McColm, MSO asymptotics on random free trees (and random strings), preprint, 1996.
24. A. I. Markushevich, Theory of Functions of a Complex Variable, Volume II, Prentice-Hall, Englewood Cliffs, NJ, 1965.
25. A. Meir and J. W. Moon, On random mapping patterns, Combinatorica, 4, 61-70 (1984).
26. H. Minc, Nonnegative Matrices, Wiley, New York, 1988.
27. R. Otter, The number of trees, Ann. Math., 49, 583-599 (1948).
28. J. B. Paris, A. Vencovská, and G. M. Wilmers, A natural prior probability distribution derived from the propositional calculus, Ann. Pure Appl. Logic, 70, 243-285 (1994).
29. G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math., 68, 145-254 (1937).
30. G. Pólya and R. C. Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, Springer-Verlag, New York, 1987.
31. J. Riordan, An Introduction to Combinatorial Analysis, Princeton University Press, Princeton, NJ, 1980.
32. E. Seneta, Non-Negative Matrices, Allen and Unwin, London, 1973.
33. J. W. Thatcher and J. B. Wright, Generalized finite automata theory with an application to a problem of second-order logic, Math. Syst. Theor., 2, 57-81 (1968).
34. J. Tyszkiewicz, Infinitary queries and their asymptotic probabilities I: properties definable in transitive closure logic. Computer Science Logic, E. Borger, G. Jäger, H. Klein Büning, and M. M. Richter, Eds. Proc. 5th Workshop, CSL'91, Berne, Switzerland, October 1991, Lecture Notes Comput. Sci, 626, 396-410 (1992).
35. J. Tyszkiewicz, Infinitary queries and their asymptotic probabilities I: properties definable in transitive closure logic. Computer Science Logic, E. Borger, G. Jäger, H. Klein Büning, and M. M. Richter, Eds. Proc. 5th Workshop, CSL'91, Berne, Switzerland, October 1991, Lecture Notes Comput. Sci, 626, 396-410 (1992).
36. J. Tyszkiewicz, Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic, Random Struct. Alg., 5, 215-234 (1994).
37. H. S. Wilf, generatingfunctionology, Academic, Boston, 1990.
38. A. R. Woods, Counting finite models, J. Symbolic Logic, to appear.