{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:46Z","timestamp":1725566746222},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_35","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"509-524","source":"Crossref","is-referenced-by-count":2,"title":["A Propositional Proof System for Log Space"],"prefix":"10.1007","author":[{"given":"Steven","family":"Perron","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Cook, S.: Theories for complexity classes and their propositional translations. In: Krajicek, J. (ed.) Complexity of computations and proofs. Quaderni di Matematica, pp. 175\u2013227 (2003), Also available at http:\/\/www.cs.toronto.edu\/~sacook\/"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/malq.19900360106","volume":"36","author":"J. Krajicek","year":"1990","unstructured":"Krajicek, J., Pudlak, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschrift f. Mathematikal Logik u. Grundlagen d. Mathematik\u00a036, 29\u201346 (1990)","journal-title":"Zeitschrift f. Mathematikal Logik u. Grundlagen d. Mathematik"},{"key":"35_CR3","unstructured":"Cook, S.: A survey of complexity classes and their associated propositional proof systems and theories, and a proof system for log space (2001), Available at http:\/\/www.cs.toronto.edu\/~sacook\/"},{"key":"35_CR4","series-title":"DIMACS: Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1090\/dimacs\/039\/14","volume-title":"Proof Complexity and Feasible Arithmetics","author":"C. Pollett","year":"1997","unstructured":"Pollett, C.: A propositional proof system for Ri2. In: Beame, P.W., Buss, S.R. (eds.) Proof Complexity and Feasible Arithmetics. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a039, pp. 253\u2013278. AMS, Providence (1997)"},{"key":"35_CR5","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.: Introduction to proof theory. In: Buss, S.R. (ed.) Handbook of Proof Theory, pp. 1\u201378. Elsevier Science Publishers, Amsterdam (1998)"},{"key":"35_CR6","unstructured":"Cook, S.: CSC 2429s: Proof complexity and bounded arithmetic. Course notes (2002), Available at http:\/\/www.cs.toronto.edu\/~sacook\/csc2429h.02"},{"key":"35_CR7","unstructured":"Cook, S., Morioka, T.: Quantified propositional calculus and a second-order theory for NC1 (accepted for Archive for Math. Logic)"},{"key":"35_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Krajicek","year":"1995","unstructured":"Krajicek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)"},{"key":"35_CR9","unstructured":"Perron, S.: GL\u2217: A propositional proof system for logspace. Master\u2019s thesis, University Of Toronto (2005), Available at http:\/\/www.cs.toronto.edu\/~sperron\/"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-24749-4_28","volume-title":"STACS 2004","author":"J. Johannsen","year":"2004","unstructured":"Johannsen, J.: Satisfiability problem complete for deterministic logarithmic space. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 317\u2013325. Springer, Heidelberg (2004)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Feasibly constructive proofs and the propositional calculus. In: Proceedings of the 7-th ACM Symposium on the Theory of computation, pp. 83\u201397 (1975)","DOI":"10.1145\/800116.803756"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0168-0072(97)00026-2","volume":"88","author":"D. Zambella","year":"1997","unstructured":"Zambella, D.: End extensions of models of linearly bounded arithmetic. Annals of Pure and Applied Logic\u00a088, 263\u2013277 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"S.A. Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. Journal of Algorithms\u00a08, 385\u2013394 (1987)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:41Z","timestamp":1605644021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11538363_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}