{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:44:49Z","timestamp":1725489889247},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_37","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T01:13:35Z","timestamp":1187918015000},"page":"496-511","source":"Crossref","is-referenced-by-count":4,"title":["Unbounded Proof-Length Speed-Up in Deduction Modulo"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Burel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and all That. CUP (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Bonacina, M.P., Dershowitz, N.: Abstract canonical inference. ACM Trans. Comput. Logic\u00a08 (2007)","DOI":"10.1145\/1182613.1182619"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Brauner, P., Houtmann, C., Kirchner, C.: Principles of superdeduction. In: LICS, IEEE Computer Society, Los Alamitos (to appear, 2007)","DOI":"10.1109\/LICS.2007.37"},{"key":"37_CR4","unstructured":"Burel, G.: Unbounded proof-length speed-up in deduction modulo. Research report (2007), Available at http:\/\/hal.inria.fr\/inria-00138195"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"916","DOI":"10.2307\/2273826","volume":"52","author":"S.R. Buss","year":"1987","unstructured":"Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. The Journal of Symbolic Logic\u00a052, 916\u2013927 (1987)","journal-title":"The Journal of Symbolic Logic"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"737","DOI":"10.2307\/2275906","volume":"59","author":"S.R. Buss","year":"1994","unstructured":"Buss, S.R.: On G\u00f6del\u2019s theorems on lengths of proofs I: Number of lines and speedup for arithmetics. The Journal of Symbolic Logic\u00a059, 737\u2013756 (1994)","journal-title":"The Journal of Symbolic Logic"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"S.A. Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic\u00a044, 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Cousineau, D., Dowek, G.: Embedding pure type systems in the lambda-pi-calculus modulo. In: TLCA (to appear, 2007)","DOI":"10.1007\/978-3-540-73228-0_9"},{"key":"37_CR9","volume-title":"Combinatory Logic","author":"H.B. Curry","year":"1958","unstructured":"Curry, H.B., Feys, R., Craig, W.: Combinatory Logic, vol.\u00a01. Elsevier Science Publishers B. V (North-Holland), Amsterdam (1958)"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2006.03.012","volume":"357","author":"N. Dershowitz","year":"2006","unstructured":"Dershowitz, N., Kirchner, C.: Abstract Canonical Presentations. Theoretical Computer Science\u00a0357, 53\u201369 (2006)","journal-title":"Theoretical Computer Science"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129500003212","volume":"11","author":"G. Dowek","year":"2001","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: HOL-\u03bb\u03c3 an intentional first-order expression of higher-order logic. Math. Structures Comput. Sci.\u00a011, 1\u201325 (2001)","journal-title":"Math. Structures Comput. Sci."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1027357912519","volume":"31","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning\u00a031, 33\u201372 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.2178\/jsl\/1067620188","volume":"68","author":"G. Dowek","year":"2003","unstructured":"Dowek, G., Werner, B.: Proof normalization modulo. The Journal of Symbolic Logic\u00a068, 1289\u20131316 (2003)","journal-title":"The Journal of Symbolic Logic"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-540-32033-3_31","volume-title":"Term Rewriting and Applications","author":"G. Dowek","year":"2005","unstructured":"Dowek, G., Werner, B.: Arithmetic as a theory modulo. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 423\u2013437. Springer, Heidelberg (2005)"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schliessen (The Collected Papers of Gerhard Gentzen as Investigations into Logical Deduction). Translated In: Szabo, M.E. (ed.) Mathematische Zeitschrift, vol.\u00a039, pp. 176\u2013210, 405\u2013431 (1934)","DOI":"10.1007\/BF01201363"},{"key":"37_CR16","first-page":"396","volume-title":"Kurt G\u00f6del: Collected Works","author":"K. G\u00f6del","year":"1986","unstructured":"G\u00f6del, K.: On the length of proofs. In: Feferman, S., et al. (eds.) Kurt G\u00f6del: Collected Works, vol.\u00a01, pp. 396\u2013399. Oxford University Press, Oxford (1986)"},{"key":"37_CR17","unstructured":"Guglielmi, A.: Polynomial size deep-inference proofs instead of exponential size shallow-inference proofs (2004), Available at http:\/\/cs.bath.ac.uk\/ag\/p\/AG12.pdf"},{"key":"37_CR18","unstructured":"Kirchner, F.: A finite first-order theory of classes (2006), Available at http:\/\/www.lix.polytechnique.fr\/Labo\/Florent.Kirchner\/doc\/fotc2006.pdf"},{"key":"37_CR19","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"A. Mostowski","year":"1953","unstructured":"Mostowski, A., Robinson, R.M., Tarski, A.: Undecidable Theories. In: Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam (1953)"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL \u2014 A Proof Assistant for Higher-Order Logic. In: Nipkow, T., Paulson, L.C., Wenzel, M. (eds.) Isabelle\/HOL. LNCS, vol.\u00a02283, Springer, Heidelberg (2002)"},{"key":"37_CR21","first-page":"29","volume":"177","author":"R.J. Parikh","year":"1973","unstructured":"Parikh, R.J.: Some results on the length of proofs. Transactions of the ACM\u00a0177, 29\u201336 (1973)","journal-title":"Transactions of the ACM"},{"key":"37_CR22","unstructured":"The Coq Development Team: The Coq Proof Assistant Reference Manual. INRIA. Version 8.0 (2006), available at http:\/\/coq.inria.fr\/doc\/main.html"}],"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_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:45:55Z","timestamp":1619505955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}