{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:48Z","timestamp":1725663228433},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156482"},{"type":"electronic","value":"9783540395270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15648-8_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:21:17Z","timestamp":1330176077000},"page":"153-166","source":"Crossref","is-referenced-by-count":11,"title":["On asymptotic probabilities of inductive queries and their decision problem"],"prefix":"10.1007","author":[{"given":"Phokion G.","family":"Kolaitis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"A. Aho and J. Ullman [1979]: Universality of data retrieval languages, Proc. 6th ACM Symposium of Programming Languages, 1979, 110\u2013120.","DOI":"10.1145\/567752.567763"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/2272133","volume":"42","author":"J. Barwise","year":"1977","unstructured":"J. Barwise [1977]: On Moschovakis closure ordinals, J. Symbolic Logic 42 (1977), 292\u2013296.","journal-title":"J. Symbolic Logic"},{"key":"13_CR3","unstructured":"A. Blass, Y. Gurevich, D. Kozen [1984]: A zero-one law for logic with a fixed-point operator, Technical Report CRL-TR-38-84, University of Michigan, 1984."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"A. Chandra and D. Harel [1982]: Structure and complexity of relational queries, J. Comp. System Sci. 25 (1982), 99\u2013128.","journal-title":"J. Comp. System Sci."},{"key":"13_CR5","volume-title":"Applications of logic to finite combinatorics","author":"K. Compton","year":"1980","unstructured":"K. Compton [1980]: Applications of logic to finite combinatorics, Ph.D. Thesis, University of Wisconsin, Madison, 1980."},{"key":"13_CR6","unstructured":"K. Compton [1984a]: A logical approach to asymptotic combinatorics I: First order properties, to appear in: Advances in Mathematics."},{"key":"13_CR7","unstructured":"K. Compton [1984b]: A logical approach to asymptotic combinatorics II: Monadic second order properties, to appear in: Advances in Mathematics."},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1017\/S0022481200051756","volume":"41","author":"R. Fagin","year":"1976","unstructured":"R. Fagin [1976]: Probabilities on finite models, J. Symbolic Logic 41 (1976), 50\u201358.","journal-title":"J. Symbolic Logic"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","volume":"57","author":"E. Grandjean","year":"1983","unstructured":"E. Grandjean [1983]: Complexity of the first-order theory of almost all structures, Information and Control 57 (1983), 180\u2013204.","journal-title":"Information and Control"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"D. Harel and D. Kozen [1984]: A programming language for the inductive sets and applications, to appear in: Information and Control.","DOI":"10.1016\/S0019-9958(84)80045-5"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"N. Immerman [1982a]: Relational queries computable in polynomial time, Proc. 14th ACM Symposium on Theory of Computing, 1982, 147\u2013152.","DOI":"10.1145\/800070.802187"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","volume":"25","author":"N. Immerman","year":"1982","unstructured":"N. Immerman [1982b]: Upper and lower bounds for first-order expressibility, J. Comp. System Sci. 25 (1982), 76\u201398.","journal-title":"J. Comp. System Sci."},{"key":"13_CR13","unstructured":"Y. N. Moschovakis [1974]: Elementary Induction on Abstract Structures, North-Holland, 1974."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S1446788700020681","volume":"20","author":"R. L. Tenney","year":"1975","unstructured":"R. L. Tenney [1975]: Second-order Ehrenfeuct games and the decidability of the second-order theory of an equivalence relation, J. Austral. Math. Soc. 20 (Series A) 1975, 323\u2013331.","journal-title":"J. Austral. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15648-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:08:32Z","timestamp":1605625712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15648-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156482","9783540395270"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-15648-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}