{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:26:55Z","timestamp":1725496015576},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_20","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T03:39:22Z","timestamp":1196048362000},"page":"241-252","source":"Crossref","is-referenced-by-count":4,"title":["The Deduction Theorem for Strong Propositional Proof Systems"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Beyersdorff, O.: Tuples of disjoint NP-sets. Theory of Computing Systems (to appear)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2007.02.005","volume":"377","author":"O. Beyersdorff","year":"2007","unstructured":"Beyersdorff, O.: Classes of representable disjoint NP-pairs. Theoretical Computer Science\u00a0377, 93\u2013109 (2007)","journal-title":"Theoretical Computer Science"},{"key":"20_CR3","first-page":"61","volume-title":"Arithmetic, Proof Theory and Computational Complexity","author":"M.L. Bonet","year":"1993","unstructured":"Bonet, M.L.: Number of symbols in Frege proofs with and without the deduction rule. In: Clote, P., Kraj\u00ed\u010dek, J. (eds.) Arithmetic, Proof Theory and Computational Complexity, pp. 61\u201395. Oxford University Press, Oxford (1993)"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"688","DOI":"10.2307\/2275228","volume":"58","author":"M.L. Bonet","year":"1993","unstructured":"Bonet, M.L., Buss, S.R.: The deduction rule and linear and near-linear proof simulations. The Journal of Symbolic Logic\u00a058(2), 688\u2013709 (1993)","journal-title":"The Journal of Symbolic Logic"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Bonet, M.L., Buss, S.R., Pitassi, T.: Are there hard examples for Frege systems? In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, Birkh\u00e4user, pp. 30\u201356 (1995)","DOI":"10.1007\/978-1-4612-2566-9_3"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proc. 3rd Annual ACM Symposium on Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM Press, New York (1971)"},{"key":"20_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":"20_CR8","unstructured":"Dowd, M.: Model-theoretic aspects of P\u2260NP. Unpublished manuscript (1985)"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ic.2005.03.003","volume":"200","author":"C. Gla\u00dfer","year":"2005","unstructured":"Gla\u00dfer, C., Selman, A.L., Sengupta, S.: Reductions between disjoint NP-pairs. Information and Computation\u00a0200(2), 247\u2013267 (2005)","journal-title":"Information and Computation"},{"issue":"6","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1137\/S0097539703425848","volume":"33","author":"C. Gla\u00dfer","year":"2004","unstructured":"Gla\u00dfer, C., Selman, A.L., Sengupta, S., Zhang, L.: Disjoint NP-pairs. SIAM Journal on Computing\u00a033(6), 1369\u20131416 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/11685654_11","volume-title":"Essays in Theoretical Computer Science in Memory of Shimon Even","author":"C. Gla\u00dfer","year":"2006","unstructured":"Gla\u00dfer, C., Selman, A.L., Zhang, L.: Survey of disjoint NP-pairs and relations to propositional proof systems. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Essays in Theoretical Computer Science in Memory of Shimon Even, pp. 241\u2013253. Springer, Heidelberg (2006)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2006.10.006","volume":"370","author":"C. Gla\u00dfer","year":"2007","unstructured":"Gla\u00dfer, C., Selman, A.L., Zhang, L.: Canonical disjoint NP-pairs of propositional proof systems. Theoretical Computer Science\u00a0370, 60\u201373 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"Grollmann, J., Selman, A.L.: Complexity measures for public-key cryptosystems. SIAM Journal on Computing\u00a017(2), 309\u2013335 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0022-0000(92)90023-C","volume":"44","author":"S. Homer","year":"1992","unstructured":"Homer, S., Selman, A.L.: Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences\u00a044(2), 287\u2013301 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0890-5401(03)00058-0","volume":"184","author":"J. K\u00f6bler","year":"2003","unstructured":"K\u00f6bler, J., Messner, J., Tor\u00e1n, J.: Optimal proof systems imply complete sets for promise classes. Information and Computation\u00a0184, 71\u201392 (2003)","journal-title":"Information and Computation"},{"key":"20_CR16","series-title":"Encyclopedia of Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Encyclopedia of Mathematics and Its Applications, vol.\u00a060. Cambridge University Press, Cambridge (1995)"},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.2307\/2274765","volume":"54","author":"J. Kraj\u00ed\u010dek","year":"1989","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic\u00a054, 1079\u20131963 (1989)","journal-title":"The Journal of Symbolic Logic"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(02)00411-5","volume":"295","author":"P. Pudl\u00e1k","year":"2003","unstructured":"Pudl\u00e1k, P.: On reducibility and symmetry of disjoint NP-pairs. Theoretical Computer Science\u00a0295, 323\u2013339 (2003)","journal-title":"Theoretical Computer Science"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: On provably disjoint NP-pairs. Technical Report TR94-006, Electronic Colloquium on Computational Complexity (1994)","DOI":"10.7146\/brics.v1i36.21607"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0304-3975(01)00155-4","volume":"288","author":"Z. Sadowski","year":"2002","unstructured":"Sadowski, Z.: On an optimal propositional proof system and the structure of easy subsets of TAUT. Theoretical Computer Science\u00a0288(1), 181\u2013193 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:55:52Z","timestamp":1619506552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}