Nonconvergence, undecidability, and intractability in asymptotic problems

Abstract Results delimiting the logical and effective content of asymptotic combinatorics are presented. For the class of binary relations with an underlying linear order, and the class of binary functions, there are properties, given by first-order sentences, without asymptotic probabilities; every first-order asymptotic problem (i.e., set of first-order sentences with asymptotic probabilities bounded by a given rational number between zero and one) for these two classes is undecidable. For the class of pairs of unary functions or permutations, there are monadic second-order properties without asymptotic probabilities; every monadic second-order asymptotic problem for this class is undecidable. No first-order asymptotic problem for the class of unary functions is elementary recursive.

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

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

[3]  Saharon Shelah,et al.  On random models of finite power and monadic logic , 1985, Discrete Mathematics.

[4]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[5]  John Riordan,et al.  Enumeration of Linear Graphs for Mappings of Finite Sets , 1962 .

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

[7]  A. Mostowski.  Review: B. A. Trahtenbrot, Impossibility of an Algorithm for the Decision Problem in Finite Classes , 1950, Journal of Symbolic Logic.

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

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

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

[11]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .

[12]  R. Z. Norman,et al.  An algorithm for a minimum cover of a graph , 1959 .

[13]  R. Vaught.  On a Theorem of Cobham Concerning Undecidable Theories , 1966 .

[14]  Kevin J. Compton.  Application of a Tauberian theorem to finite model theory , 1985, Arch. Math. Log..

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

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

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

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