{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:02Z","timestamp":1725490262288},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74915-8_16","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"177-193","source":"Crossref","is-referenced-by-count":15,"title":["Classical and Intuitionistic Logic Are Asymptotically Identical"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[]},{"given":"Dani\u00e8le","family":"Gardy","sequence":"additional","affiliation":[]},{"given":"Antoine","family":"Genitrini","sequence":"additional","affiliation":[]},{"given":"Marek","family":"Zaionc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4-5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0963548304006273","volume":"13","author":"B. Chauvin","year":"2004","unstructured":"Chauvin, B., Flajolet, P., Gardy, D., Gittenberger, B.: And\/Or trees revisited. Combinatorics, Probability and Computing\u00a013(4-5), 475\u2013497 (2004)","journal-title":"Combinatorics, Probability and Computing"},{"key":"16_CR2","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics: functional equations, rational and algebraic functions, INRIA, Number 4103 (2001)"},{"key":"16_CR3","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics. Book in preparation (2007), available at http:\/\/algo.inria.fr\/flajolet\/Publications\/books.html"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Gardy, D.: Random Boolean expressions, Colloquium on Computational Logic and Applications. In: Proceedings in DMTCS, Chambery (France), June 2005, pp. 1\u201336 (2006)","DOI":"10.46298\/dmtcs.3475"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Gardy, D., Woods, A.: And\/or tree probabilities of Boolean function. Discrete Mathematics and Theoretical Computer Science, 139\u2013146 (2005)","DOI":"10.46298\/dmtcs.3355"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:STUD.0000032101.88511.93","volume":"76","author":"Z. Kostrzycka","year":"2004","unstructured":"Kostrzycka, Z., Zaionc, M.: Statistics of intuitionnistic versus classical logic. Studia Logica\u00a076(3), 307\u2013328 (2004)","journal-title":"Studia Logica"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<337::AID-RSA4>3.0.CO;2-X","volume":"10","author":"H. Lefmann","year":"1997","unstructured":"Lefmann, H., Savick\u00fd, P.: Some typical properties of large And\/Or Boolean formulas. Random Structures and Algorithms\u00a010, 337\u2013351 (1997)","journal-title":"Random Structures and Algorithms"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.entcs.2005.06.022","volume":"140","author":"G. Matecki","year":"2005","unstructured":"Matecki, G.: Asymptotic density for equivalence. Electronic Notes in Theoretical Computer Science\u00a0140, 81\u201391 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"5","key":"16_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1017\/S0960129599002959","volume":"10","author":"M. Moczurad","year":"2000","unstructured":"Moczurad, M., Tyszkiewicz, J., Zaionc, M.: Statistical properties of simple types. Mathematical Structures in Computer Science\u00a010(5), 575\u2013594 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"S\u00f8rensen, M., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Studies in Logic and the Foundations of Mathematics\u00a0149 (2006)","DOI":"10.1016\/S0049-237X(06)80005-4"},{"key":"16_CR11","volume-title":"Generatingfunctionology","author":"H. Wilf","year":"1994","unstructured":"Wilf, H.: Generatingfunctionology, 2nd edn. Academic Press, Boston (1994)","edition":"2"},{"key":"16_CR12","first-page":"67","volume":"39","author":"M. Zaionc","year":"2005","unstructured":"Zaionc, M.: On the asymptotic density of tautologies in logic of implication and negation. Reports on Mathematical Logic\u00a039, 67\u201387 (2005)","journal-title":"Reports on Mathematical Logic"},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2006.01.002","volume":"355","author":"M. Zaionc","year":"2006","unstructured":"Zaionc, M.: Probability distribution for simple tautologies. Theoretical Computer Science\u00a0355(2), 243\u2013260 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T22:26:41Z","timestamp":1684016801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749141","9783540749158"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}