{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:17:28Z","timestamp":1738217848855,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_28","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"318-329","source":"Crossref","is-referenced-by-count":3,"title":["Logical Closure Properties of Propositional Proof Systems"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ic.2003.10.004","volume":"189","author":"A. Atserias","year":"2004","unstructured":"Atserias, A., Bonet, M.L.: On the automatizability of resolution and related propositional proof systems. Information and Computation\u00a0189(2), 182\u2013201 (2004)","journal-title":"Information and Computation"},{"key":"28_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":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-77050-3_20","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"O. Beyersdorff","year":"2007","unstructured":"Beyersdorff, O.: The deduction theorem for strong propositional proof systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 241\u2013252. Springer, Heidelberg (2007)"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1093\/oso\/9780198536901.003.0004","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":"28_CR5","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":"28_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-1-4612-2566-9_3","volume-title":"Feasible Mathematics II","author":"M.L. Bonet","year":"1995","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, pp. 30\u201356. Birkh\u00e4user, Basel (1995)"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"708","DOI":"10.2307\/2275569","volume":"62","author":"M.L. Bonet","year":"1997","unstructured":"Bonet, M.L., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. The Journal of Symbolic Logic\u00a062(3), 708\u2013728 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"28_CR8","unstructured":"Buss, S.R.: Bounded Arithmetic. Bibliopolis, Napoli (1986)"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0049-237X(98)80016-5","volume-title":"Handbook of Proof Theory","author":"S.R. Buss","year":"1998","unstructured":"Buss, S.R.: An introduction to proof theory. In: Buss, S.R. (ed.) Handbook of Proof Theory, pp. 1\u201378. Elsevier, Amsterdam (1998)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: Proc. 7th Annual ACM Symposium on Theory of Computing, pp. 83\u201397 (1975)","DOI":"10.1145\/800116.803756"},{"key":"28_CR11","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":"28_CR12","first-page":"68","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift\u00a039, 68\u2013131 (1935)","journal-title":"Mathematische Zeitschrift"},{"issue":"2","key":"28_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"},{"key":"28_CR14","volume-title":"Perspectives in Mathematical Logic","author":"P. H\u00e1jek","year":"1993","unstructured":"H\u00e1jek, P., Pudl\u00e1k, P.: Metamathematics of First-Order Arithmetic. In: Perspectives in Mathematical Logic, Springer, Berlin (1993)"},{"key":"28_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":"28_CR16","series-title":"Encyclopedia of Mathematics and Its Applications","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2275541","volume":"62","author":"J. Kraj\u00ed\u010dek","year":"1997","unstructured":"Kraj\u00ed\u010dek, J.: Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic. The Journal of Symbolic Logic\u00a062(2), 457\u2013486 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"28_CR18","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":"28_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/malq.19900360106","volume":"36","author":"J. Kraj\u00ed\u010dek","year":"1990","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik\u00a036, 29\u201346 (1990)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P. Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting planes proofs and monotone computations. The Journal of Symbolic Logic\u00a062, 981\u2013998 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"28_CR21","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":"28_CR22","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":"28_CR23","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"},{"issue":"1\u20132","key":"28_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.3233\/FUN-2007-791-208","volume":"79","author":"Z. Sadowski","year":"2007","unstructured":"Sadowski, Z.: Optimal proof systems, optimal acceptors and recursive presentability. Fundamenta Informaticae\u00a079(1\u20132), 169\u2013185 (2007)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"28_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0207018","volume":"7","author":"C. Wrathall","year":"1978","unstructured":"Wrathall, C.: Rudimentary predicates and relative computation. SIAM Journal on Computing\u00a07(2), 149\u2013209 (1978)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T23:02:38Z","timestamp":1738191758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_28","relation":{},"subject":[]}}