{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T16:00:59Z","timestamp":1765123259954,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0168-0072(87)90017-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T07:12:53Z","timestamp":1047625973000},"page":"207-224","source":"Crossref","is-referenced-by-count":24,"special_numbering":"C","title":["Nonconvergence, undecidability, and intractability in asymptotic problems"],"prefix":"10.1016","volume":"36","author":[{"given":"Kevin J.","family":"Compton","sequence":"first","affiliation":[]},{"given":"C.","family":"Ward Henson","sequence":"additional","affiliation":[]},{"given":"Saharon","family":"Shelah","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(87)90017-0_BIB1","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/0168-0072(87)90017-0_BIB2","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(85)80027-9","article-title":"A zero-one law for logic with a fixed-point operator","volume":"67","author":"Blass","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0168-0072(87)90017-0_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02007559","article-title":"Application of a Tauberian theorem to finite model theory","volume":"25","author":"Compton","year":"1985","journal-title":"Arch. Math. Logik Grundlag."},{"key":"10.1016\/0168-0072(87)90017-0_BIB4","unstructured":"K. Compton, A logical approach to asymptotic combinatorics II: Monadic second order properties, to appear."},{"key":"10.1016\/0168-0072(87)90017-0_BIB5","doi-asserted-by":"crossref","first-page":"842","DOI":"10.2307\/2274138","article-title":"An undecidable problem in finite combinatorics","volume":"49","author":"Compton","year":"1984","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(87)90017-0_BIB6","unstructured":"K. Compton and C.W. Henson, A simple method for proving lower bounds on the complexity of logical theories, Ann. Pure Appl. Logic, to appear."},{"key":"10.1016\/0168-0072(87)90017-0_BIB7","unstructured":"K. Compton and S. Shelah, A convergence theorem for unary functions, in preparation."},{"key":"10.1016\/0168-0072(87)90017-0_BIB8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1070\/RM1965v020n04ABEH001188","article-title":"Elementary theories","volume":"20","author":"Ershov","year":"1965","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/0168-0072(87)90017-0_BIB9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(87)90017-0_BIB10","article-title":"The Computational Complexity of Logical Theories","volume":"718","author":"Ferrante","year":"1979"},{"key":"10.1016\/0168-0072(87)90017-0_BIB11","first-page":"17","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","volume":"2","author":"Glebskii","year":"1969","journal-title":"Kibernetika (Kiev)"},{"key":"10.1016\/0168-0072(87)90017-0_BIB12","first-page":"267","article-title":"Sur la distribution des cycles dans les permutations","volume":"35","author":"Goncharov","year":"1942","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0168-0072(87)90017-0_BIB13","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","article-title":"Complexity of the first-order theory of almost all finite structures","volume":"57","author":"Grandjean","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0168-0072(87)90017-0_BIB14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(85)90112-8","article-title":"Random models of finite power and monadic logic","volume":"54","author":"Kaufmann","year":"1985","journal-title":"Discrete Math."},{"year":"1978","series-title":"Random Allocations","author":"Kolchin","key":"10.1016\/0168-0072(87)90017-0_BIB15"},{"key":"10.1016\/0168-0072(87)90017-0_BIB16","doi-asserted-by":"crossref","first-page":"392","DOI":"10.2307\/2307900","article-title":"The expected number of components under a random mapping function","volume":"61","author":"Kruskal","year":"1954","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0168-0072(87)90017-0_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0003-4843(80)90014-5","article-title":"Almost sure theories","volume":"18","author":"Lynch","year":"1980","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0168-0072(87)90017-0_BIB18","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1090\/S0002-9947-1985-0768725-2","article-title":"First-order probabilities of random unary functions","volume":"287","author":"Lynch","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(87)90017-0_BIB19","first-page":"315","article-title":"An algorithm for a minimum cover of a graph","volume":"10","author":"Norman","year":"1959"},{"key":"10.1016\/0168-0072(87)90017-0_BIB20","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)71116-9","article-title":"Decidable theories","author":"Rabin","year":"1977"},{"year":"1970","series-title":"Probability Theory","author":"Renyi","key":"10.1016\/0168-0072(87)90017-0_BIB21"},{"key":"10.1016\/0168-0072(87)90017-0_BIB22","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1214\/aoms\/1177704722","article-title":"Enumeration of linear graphs for mappings of finite sets","volume":"33","author":"Riordan","year":"1962","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/0168-0072(87)90017-0_BIB23","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1090\/S0002-9947-1966-0195117-8","article-title":"Ordered cycle lengths in random permutations","volume":"121","author":"Shepp","year":"1966","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(87)90017-0_BIB24","first-page":"569","article-title":"Impossibility of an algorithm for the decision problem in finite classes","volume":"70","author":"Trachtenbrot","year":"1950","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0168-0072(87)90017-0_BIB25","series-title":"Proc. of the 1960 International Congress","first-page":"19","article-title":"On a theorem of Cobham concerning undecidable theories","author":"Vaught","year":"1962"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007287900170?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007287900170?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T21:56:55Z","timestamp":1553637415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007287900170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":25,"alternative-id":["0168007287900170"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(87)90017-0","relation":{},"ISSN":["0168-0072"],"issn-type":[{"type":"print","value":"0168-0072"}],"subject":[],"published":{"date-parts":[[1987]]}}}