{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:51Z","timestamp":1725664791037},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616306"},{"type":"electronic","value":"9783540706434"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61630-6_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:09:07Z","timestamp":1330276147000},"page":"354-372","source":"Crossref","is-referenced-by-count":0,"title":["Informational logic for automated reasoning"],"prefix":"10.1007","author":[{"given":"Paola","family":"Forcheri","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Gentilini","sequence":"additional","affiliation":[]},{"given":"Maria Teresa","family":"Molfino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"25_CR1","first-page":"1","volume-title":"Formal Techniques in Artificial Intelligence","author":"J. Avenhaus","year":"1990","unstructured":"J. Avenhaus and K. Madlener. Term rewriting and equational reasoning. In Formal Techniques in Artificial Intelligence, pages 1\u201343. North-Holland, Amsterdam, 1990."},{"doi-asserted-by":"crossref","unstructured":"R. S. Boyer and J. S. Moore. Proving theorems about lisp functions. JACM, pages 129\u2013144, 1975.","key":"25_CR2","DOI":"10.1145\/321864.321875"},{"key":"25_CR3","volume-title":"Handbook of Logic in AI and Logic Programming","author":"D. Dubois","year":"1994","unstructured":"D. Dubois, J. Lang, and H. Prade. Possibilistic logic. In J. A. Robinson Dov M. Gabbay, C. J. Hogger, editor, Handbook of Logic in AI and Logic Programming. Clarendon Press, Oxford, 1994."},{"key":"25_CR4","first-page":"491","volume-title":"Logic and Algebra","author":"P. Forcheri","year":"1996","unstructured":"P. Forcheri, P. Gentilini, and M. T. Molfino. Research in automated deduction as a basis for a probabilistic proof-theory. In P. Agliano' and A. Ursini, editors, Logic and Algebra, pages 491\u2013528. Dekker, New York, 1996."},{"key":"25_CR5","volume-title":"Information Theory and Reliable Communication","author":"R. Gallager","year":"1968","unstructured":"R. Gallager. Information Theory and Reliable Communication. John Wiley and Sons, New York, 1968."},{"key":"25_CR6","first-page":"536","volume":"38","author":"P. Gentilini","year":"1992","unstructured":"P. Gentilini. Provability logic in the Gentzen formulation of arithmetic. Z. Math. Log. Grundlagen. Math., 38:536\u2013550, 1992.","journal-title":"Z. Math. Log. Grundlagen. Math."},{"unstructured":"P. Gentilini. Informational proof-theory. In Centro F. Enriquez, editor, Proceedings of International Conference on Logic Methodology and Philosophy of Science, page 47. Florence, 1995.","key":"25_CR7"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"J.Y. Girard. Linear logic. TCS, 50:1\u2013102, 1987.","journal-title":"TCS"},{"key":"25_CR9","volume-title":"Mathematical Foundations of Information Theory","author":"A. I. Khinchin","year":"1957","unstructured":"A. I. Khinchin. Mathematical Foundations of Information Theory. Dover Publications, New York, 1957."},{"doi-asserted-by":"crossref","unstructured":"J. Krajicek and P. Pudlak. The number of proof lines and the size of proofs in first order logic. Archive for Mathematical Logic, pages 69\u201384, 1988.","key":"25_CR10","DOI":"10.1007\/BF01625836"},{"key":"25_CR11","volume-title":"Handbook of Logic in AI and Logic Programming,vol.3","author":"H. E. Kyburg","year":"1994","unstructured":"H. E. Kyburg. Uncertainty logics. In J. A. Robinson Dov M. Gabbay, C. J. Hogger, editor, Handbook of Logic in AI and Logic Programming,vol.3. Clarendon Press, Oxford, 1994."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/S0002-9947-1973-0432416-X","volume":"177","author":"R. J. Parikh","year":"1973","unstructured":"R. J. Parikh. Some results on the length of proofs. Trans. of Am. Math. Soc, 177:29\u201336, 1973.","journal-title":"Trans. of Am. Math. Soc"},{"key":"25_CR13","volume-title":"Handbook of Logic in AI and Logic Programming, vol.2","author":"D. Perlis","year":"1994","unstructured":"D. Perlis and V. S. Subrahmanian. Meta-languages, reflection principles and self-reference. In J. A. Robinson Dov M. Gabbay, C. J. Hogger, editor, Handbook of Logic in AI and Logic Programming, vol.2. Clarendon Press, Oxford, 1994."},{"key":"25_CR14","volume-title":"Handbook of Mathematical Logic","author":"C. Smorynski","year":"1977","unstructured":"C. Smorynski. The incompleteness theorems. In Barwise, editor, Handbook of Mathematical Logic. North Holland, Amsterdam, 1977."},{"key":"25_CR15","volume-title":"Proof Theory","author":"G. Takeuti","year":"1987","unstructured":"G. Takeuti. Proof Theory. North-Holland, Amsterdam, 1987."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61630-6_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:35:18Z","timestamp":1619559318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61630-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616306","9783540706434"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61630-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}