{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:08:34Z","timestamp":1736140114488,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023784","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"396-410","source":"Crossref","is-referenced-by-count":7,"title":["Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"Tyszkiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0001-8708(87)90019-3","volume":"65","author":"K.J. Compton","year":"1987","unstructured":"K.J. Compton. A logical approach to asymptotic combinatorics I. First order properties, Advances in Mathematics 65(1987), 65\u201396.","journal-title":"Advances in Mathematics"},{"key":"31_CR2","volume-title":"0\u20131 laws in logic and combinatorics","author":"K.J. Compton","year":"1988","unstructured":"K.J. Compton. 0\u20131 laws in logic and combinatorics, Proc. NATO Advanced Study Institute on Algorithms and Order (I. Rival, ed.), Reidel, Dordrecht (1988)."},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0168-0072(87)90017-0","volume":"36","author":"K.J. Compton","year":"1987","unstructured":"K.J. Compton, C.W. Henson, and S. Shelah. Nonconvergence, undecidability and intractability in asymptotic problems, Annals of Pure and Applied Logic, 36(1987), 207\u2013224.","journal-title":"Annals of Pure and Applied Logic"},{"key":"31_CR4","unstructured":"K.J. Compton, and S. Shelah. A convergence theorem for unary functions, in preparation."},{"key":"31_CR5","volume-title":"Handbook of theoretical computer science","author":"P. Cousot","year":"1990","unstructured":"P. Cousot. Methods and logics for proving programs, in: J. van Leeuven (ed.) Handbook of theoretical computer science, North Holland, Amsterdam, 1990."},{"key":"31_CR6","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s, and A. R\u00e9nyi. On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl. 5(1960), 17\u201361.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl."},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(84)80023-6","volume":"60","author":"D. Harel","year":"1984","unstructured":"D. Harel, and D. Peleg. On static logics, dynamic logics, and complexity classes, Infor. and Control 60(1984), 86\u2013102.","journal-title":"Infor. and Control"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1214\/aoms\/1177705677","volume":"31","author":"B. Harris","year":"1960","unstructured":"B. Harris. Probability distributions related to random mappings, The Annals of Mathematical Statistics 31(1960), 1045\u20131062.","journal-title":"The Annals of Mathematical Statistics"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"N. Immerman. Languages that capture complexity classes, SIAM Journal of Computing 16, No. 4(1987).","DOI":"10.1137\/0216051"},{"key":"31_CR10","series-title":"Lecture Notes in Comp. Sci. 193","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-15648-8_13","volume-title":"Logics of Programs","author":"P. Kolaitis","year":"1985","unstructured":"Ph. Kolaitis. On asymptotic probabilities of inductive queries and their decision problem, in: Logics of Programs, Brooklyn, June 1985, Lecture Notes in Comp. Sci. 193, Springer Verlag, 1985, 153\u2013166."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Ph. Kolaitis, and M.Y. Vardi. Zero-one laws for infinitary logics, Proc. 5th IEEE Symp. on Logic in Computer Science, 1990, 156\u2013167.","DOI":"10.1109\/LICS.1990.113742"},{"key":"31_CR12","volume-title":"Handbook of theoretical computer science","author":"D. Kozen","year":"1990","unstructured":"D. Kozen, and J. Tiuryn. Logics of programs, in: J. van Leeuven (ed.) Handbook of theoretical computer science, North Holland, Amsterdam, 1990."},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(88)90052-7","volume":"60","author":"J. Tiuryn","year":"1988","unstructured":"J. Tiuryn, and P. Urzyczyn. Some relationships between logics of programs and complexity theory, Theoretical Computer Science, 60(1988), 83\u2013108.","journal-title":"Theoretical Computer Science"},{"key":"31_CR14","unstructured":"J. Tyszkiewicz. Infinitary Queries and Their Asymptotic Probabilities II: Properties Definable in Least Fixed Point Logic, to appear in Proc. Random Graphs'91, Pozna\u0144, Poland, August 1991."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023784.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:09:31Z","timestamp":1736104171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0023784","relation":{},"subject":[]}}