{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:53:55Z","timestamp":1773820435980,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540569923","type":"print"},{"value":"9783540478904","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56992-8_26","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:00:33Z","timestamp":1330257633000},"page":"425-439","source":"Crossref","is-referenced-by-count":7,"title":["On asymptotic probabilities of monadic second order properties"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"Tyszkiewicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"26_CR1","volume-title":"0\u20131 laws in logic and combinatorics","author":"K.J. Compton","year":"1988","unstructured":"Compton, K.J., 0\u20131 laws in logic and combinatorics, Proc. NATO Advanced Study Institute on Algorithms and Order (I. Rival, ed.), Reidel, Dordrecht (1988)."},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0890-5401(88)90032-6","volume":"78","author":"K.J. Compton","year":"1988","unstructured":"Compton, K.J., The Computational Complexity of Asymptotic Problems I: Partial Orders, Information and Computation\n78(1988), pp. 108\u2013123.","journal-title":"Information and Computation"},{"key":"26_CR3","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., and R\u00e9nyi, A., On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl.\n5(1960), pp. 17\u201361.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl."},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1017\/S0022481200051756","volume":"41","author":"R. Fagin","year":"1976","unstructured":"Fagin, R., Probabilities on finite models, J. Symbolic Logic\n41(1976), pp. 50\u201358.","journal-title":"J. Symbolic Logic"},{"key":"26_CR5","unstructured":"Kaufmann, M. A counterexample to the 0\u20131 law for existential monadic second-order logic, CLI Internal Note 32, Computational Logic Inc., Dec. 1987."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(85)90112-8","volume":"54","author":"M. Kaufmann","year":"1985","unstructured":"Kaufmann, M., Shelah, S., On random models of finite power and monadic logic, Discrete Math.\n54(1985), pp. 285\u2013293.","journal-title":"Discrete Math."},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1090\/S0273-0979-1985-15403-5","volume":"13","author":"P. Kolaitis","year":"1985","unstructured":"Kolaitis, Ph.G., Pr\u0151mel, H., and Rothschild, B., Asymptotic enumeration and a 0\u20131 law for m-clique free graphs, Bull. Amer. Math. Soc. (N.S.)\n13(1985), pp. 160\u2013162.","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"26_CR8","unstructured":"Kolaitis, Ph.G., Pr\u0151mel, H., and Rothschild, B., K\nl+1-free graphs: asymptotic structure and a 0\u20131 law, preprint."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/jgt.3190100214","volume":"10","author":"A. Ruci\u0144ski","year":"1986","unstructured":"Ruci\u0144ski, A., and Vince, A., Strongly balanced graphs and random graphs, J. Graph Th.\n10(1986), pp. 251\u2013264.","journal-title":"J. Graph Th."},{"key":"26_CR10","first-page":"97","volume":"1","author":"S. Shelah","year":"1988","unstructured":"Shelah, S., Spencer, J., Zero-one law for sparse random graphs, Journal of the AMS, 1(1988), pp. 97\u2013115.","journal-title":"Journal of the AMS"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Tyszkiewicz, J., Infinitary queries and their asymptotic probabilities I: Properties definable in Transitive Closure Logic in: E. B\u00f6rger et al. (eds.), Proc. Computer Science Logic '91, LNCS 626, Springer Verlag, pp. 396\u2013410.","DOI":"10.1007\/BFb0023784"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Tyszkiewicz, J., Infinitary queries and their asymptotic probabilities II: Properties definable in Least Fixed Point Logic to appear in: A. Frieze et al., eds., Proc. Random Graphs '91, Wiley (?).","DOI":"10.1002\/rsa.3240050120"},{"key":"26_CR13","unstructured":"Tyszkiewicz, J., On asymptotic probabilities in logics that capture DSPACE(log n) in presence of ordering, to appear in Proc. CAAP '93."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56992-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:58:03Z","timestamp":1619571483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56992-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569923","9783540478904"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56992-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}