{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:06Z","timestamp":1725490266057},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_38","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T01:13:35Z","timestamp":1187918015000},"page":"512-526","source":"Crossref","is-referenced-by-count":0,"title":["Propositional Logic for Circuit Classes"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Aehlig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnold","family":"Beckmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00153-002-0169-4","volume":"42","author":"A. Beckmann","year":"2003","unstructured":"Beckmann, A.: Dynamic ordinal analysis. Archive for Mathematical Logic\u00a042, 303\u2013334 (2003)","journal-title":"Archive for Mathematical Logic"},{"issue":"3","key":"38_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/plms\/s3-69.1.1","volume":"69","author":"S.R. Buss","year":"1994","unstructured":"Buss, S.R., Kraj\u00ed\u010dek, J.: An application of boolean complexity to separation problems in bounded arithmetic. Proceedings of the London Mathematical Society\u00a069(3), 1\u201327 (1994)","journal-title":"Proceedings of the London Mathematical Society"},{"doi-asserted-by":"crossref","unstructured":"Clote, P., Takeuti, G.: First order bounded arithmetic and small Boolean circuit complexity classes. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, Birkh\u00e4user, Boston, MA. Progr. Comput. Sci. Appl. Logic, vol.\u00a013, pp. 154\u2013218 (1995)","key":"38_CR3","DOI":"10.1007\/978-1-4612-2566-9_6"},{"unstructured":"Cook, S.A.: Theories for complexity classes and their propositional translations. In Kraj\u00ed\u010dek, J. (ed.) Complexity of computations and proofs, Quaderni die Matematica, pp. 175\u2013227. Dipartimento di Matematica, Seconda Universit\u00e1 degli Studi di Napoli (2003)","key":"38_CR4"},{"issue":"6","key":"38_CR5","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00153-005-0282-2","volume":"44","author":"S.A. Cook","year":"2005","unstructured":"Cook, S.A., Morioka, T.: Quantified propositional calculus and a second-order theory for NC\n                  1. Arch. Math. Logic\u00a044(6), 711\u2013749 (2005)","journal-title":"Arch. Math. Logic"},{"unstructured":"Cook, S.A., Nguyen, P.: Foundations of proof complexity: Bounded arithmetic and propositional translations. draft of a book, available at \n                    \n                      http:\/\/www.cs.toronto.edu\/~sacook\/csc2429h\/book\/","key":"38_CR6"},{"doi-asserted-by":"crossref","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic\u00a044(1) (1979)","key":"38_CR7","DOI":"10.2307\/2273702"},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2275250","volume":"59","author":"J. Kraj\u00ed\u010dek","year":"1994","unstructured":"Kraj\u00ed\u010dek, J.: Lower bounds to the size of constant-depth propositional proofs. The Journal of Symbolic Logic\u00a059(1), 73\u201386 (1994)","journal-title":"The Journal of Symbolic Logic"},{"key":"38_CR9","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":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/11538363_35","volume-title":"Computer Science Logic","author":"S. Perron","year":"2005","unstructured":"Perron, S.: A propositional proof system for log space. In: Ong, C.-H.L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 509\u2013524. Springer, Heidelberg (2005)"},{"key":"38_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-46825-7","volume-title":"An introduction","author":"W. Pohlers","year":"1989","unstructured":"Pohlers, W.: Proof theory. An introduction, Lecture Notes in Mathematics, vol.\u00a01407, Springer, Heidelberg (1989)"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1007\/978-3-540-27836-8_96","volume-title":"Automata, Languages and Programming","author":"A. Skelley","year":"2004","unstructured":"Skelley, A.: Propositional PSPACE reasoning with Boolean programs versus quantified Boolean formulas. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1163\u20131175. Springer, Heidelberg (2004)"},{"key":"38_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BFb0079691","volume-title":"The Syntax and Semantics of Infinitatry Languages","author":"W.W. Tait","year":"1968","unstructured":"Tait, W.W.: Normal derivability in classical logic. In: Barwise, J. (ed.) The Syntax and Semantics of Infinitatry Languages. Lecture Notes in Mathematics, vol.\u00a072, pp. 204\u2013236. Springer, Heidelberg (1968)"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0168-0072(94)00008-Q","volume":"71","author":"G. Takeuti","year":"1995","unstructured":"Takeuti, G.: Separations of theories in weak bounded arithmetic. Annals of Pure and Applied Logic\u00a071, 47\u201367 (1995)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"38_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-0000(88)90031-1","volume":"36","author":"C.B. Wilson","year":"1988","unstructured":"Wilson, C.B.: A measure of relativized space which is faithful with respect to depth. Journal of Computer and System Sciences\u00a036(3), 303\u2013312 (1988)","journal-title":"Journal of Computer and System Sciences"}],"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_38.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_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}