A logical approach to asymptotic combinatorics II: Monadic second-order properties
暂无分享,去创建一个
[1] A. Ehrenfeucht. An application of games to the completeness problem for formalized theories , 1961 .
[2] K. Knopp. Theory of Functions , 1958 .
[3] E. Bender. Asymptotic Methods in Enumeration , 1974 .
[4] Ronald Fagin,et al. Probabilities on finite models , 1976, Journal of Symbolic Logic.
[5] K. Compton. A Logical Approach to Asymptotic Combinatorics I. First Order Properties , 1987 .
[6] J. Lynch. Almost sure theories , 1980 .
[7] Kevin J. Compton,et al. An undecidable problem in finite combinatorics , 1984, Journal of Symbolic Logic.
[8] W. Burnside. Theory of Functions , 1899, Nature.
[9] W. Hayman. A Generalisation of Stirling's Formula. , 1956 .
[10] H. R. Pitt. Divergent Series , 1951, Nature.
[11] J. Lynch. Probabilities of first-order sentences about unary functions , 1985 .