A Logical Approach to Asymptotic Combinatorics I. First Order Properties

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  G. L..  Collected Papers , 1912, Nature.

[3]  E. Bell,et al.  Postulational Bases for the Umbral Calculus , 1940 .

[4]  R. Otter.  The Number of Trees , 1948 .

[5]  N. Metropolis,et al.  A PROPERTY OF RANDOMNESS OF AN ARITHMETICAL FUNCTION , 1953 .

[6]  M. Kruskal,et al.  The Expected Number of Components Under a Random Mapping Function , 1954 .

[7]  Leo Katz,et al.  Probability of Indecomposability of a Random Mapping Function , 1955 .

[8]  W. Hayman.  A Generalisation of Stirling's Formula. , 1956 .

[9]  Paul Erdös,et al.  Monotonicity of partition functions , 1956 .

[10]  E. Gilbert.  Enumeration Of Labelled Graphs , 1956, Canadian Journal of Mathematics.

[11]  N. D. Bruijn.  Asymptotic methods in analysis , 1958 .

[12]  Shô Iseki,et al.  A generalization of a functional equation related to the theory of partitions , 1960 .

[13]  L. A. Shepp,et al.  Ordered cycle lengths in a random permutation , 1966 .

[14]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[15]  John Riordan,et al.  Forests of labeled trees , 1968 .

[16]  Gian-Carlo Rota,et al.  On the foundations of combinatorial theory III , 1969 .

[17]  Edward A. Bender,et al.  THE ENUMERATIVE USES OF GENERATING FUNCTIONS. , 1969 .

[18]  Frank Harary,et al.  Graphical enumeration , 1973 .

[19]  D. Foata.  La série génératrice exponentielle dans les problèmes d'énumération , 1974 .

[20]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[21]  E. Bender.  Asymptotic Methods in Enumeration , 1974 .

[22]  B. Rothschild,et al.  Asymptotic enumeration of partial orders on a finite set , 1975 .

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

[24]  Ronald Fagin,et al.  The number of finite relational structures , 1977, Discret. Math..

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

[26]  Kevin J. Compton,et al.  Some useful preservation theorems , 1983, Journal of Symbolic Logic.

[27]  Etienne Grandjean,et al.  Complexity of the First-Order Theory of Almost All Finite Structures , 1983, Inf. Control..

[28]  Kevin J. Compton,et al.  An undecidable problem in finite combinatorics , 1984, Journal of Symbolic Logic.

[29]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[30]  Steven Roman.  The Umbral Calculus , 1984 .

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

[33]  Kevin J. Compton.  The Computational Complexity of Asymptotic Problems I: Partial Orders , 1988, Inf. Comput..

[34]  Kevin J. Compton,et al.  A logical approach to asymptotic combinatorics II: Monadic second-order properties , 1989, J. Comb. Theory A.