{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:38:28Z","timestamp":1648568308511},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,13]],"date-time":"2007-10-13T00:00:00Z","timestamp":1192233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00224-007-9058-x","type":"journal-article","created":{"date-parts":[[2007,10,12]],"date-time":"2007-10-12T11:34:49Z","timestamp":1192188889000},"page":"185-203","source":"Crossref","is-referenced-by-count":5,"title":["Feasible Operations on Proofs: The Logic of\u00a0Proofs for\u00a0Bounded Arithmetic"],"prefix":"10.1007","volume":"43","author":[{"given":"Evan","family":"Goris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,13]]},"reference":[{"key":"9058_CR1","unstructured":"Antonakos, E.: Justified knowledge is sufficient. Technical Report TR-2006004, CUNY Ph.D. Program in Computer Science (2006)"},{"key":"9058_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Symposium on Logical Foundations of Computer Science 2007","author":"E. Antonakos","year":"2007","unstructured":"Antonakos, E.: Justified and common knowledge: limited conservativity. In: Artemov, S.N., Nerode, A. (eds.) Symposium on Logical Foundations of Computer Science 2007. Lecture Notes in Computer Science, vol. 4514, pp. 1\u201311. Springer, Berlin (2007)"},{"key":"9058_CR3","unstructured":"Artemov, S.N.: Operational modal logic. Technical Report MSI 95-29, Cornell University (1995)"},{"issue":"1","key":"9058_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S.N. Artemov","year":"2001","unstructured":"Artemov, S.N.: Explicit provability and constructive semantics. Bull. Symb. Log. 7(1), 1\u201336 (2001)","journal-title":"Bull. Symb. Log."},{"key":"9058_CR5","first-page":"229","volume-title":"Handbook of Philosophical Logic","author":"S.N. Artemov","year":"2004","unstructured":"Artemov, S.N., Beklemishev, L.D.: Provability logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, 2nd edn., vol. 13, pp. 229\u2013403. Springer, Berlin (2004)","edition":"2"},{"key":"9058_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/11874683_9","volume-title":"Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL","author":"S.N. Artemov","year":"2006","unstructured":"Artemov, S.N., Kuznets, R.: Logical omniscience via proof complexity. In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25\u201329, 2006. Lecture Notes in Computer Science, vol. 4207, pp. 135\u2013149. Springer, Berlin (2006)"},{"key":"9058_CR7","unstructured":"Artemov, S.N., Nogina, E.: Logic of knowledge with justifications from the provability perspective. Technical Report TR-2004011, CUNY Ph.D. Program in Computer Science (2004)"},{"key":"9058_CR8","unstructured":"Artemov, S.N., Nogina, E.: Basic systems of epistemic logic with justifications. Technical Report TR-2005004, CUNY Ph.D. Program in Computer Science (2005)"},{"issue":"6","key":"9058_CR9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/logcom\/exi053","volume":"15","author":"S.N. Artemov","year":"2005","unstructured":"Artemov, S.N., Nogina, E.: Introducing justification into epistemic logic. J. Log. Comput. 15(6), 10\u201359 (2005)","journal-title":"J. Log. Comput."},{"key":"9058_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0168-0072(93)90199-N","volume":"61","author":"A. Berarducci","year":"1993","unstructured":"Berarducci, A., Verbrugge, R.: On the provability logic of bounded arithmetic. Ann. Pure Appl. Log. 61, 75\u201393 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"9058_CR11","unstructured":"Buss, S.R.: Bounded arithmetic. Bibliopolis, Napels. Revision of PhD thesis (1986)"},{"key":"9058_CR12","series-title":"Studies in Logic and the Foundations of Mathematics","first-page":"475","volume-title":"Handbook of Proof Theory","author":"S.R. Buss","year":"1998","unstructured":"Buss, S.R.: First-order theory of arithmetic. In: Buss, S.R. (ed.) Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0137, pp.\u00a0475\u2013546. Elsevier, Amsterdam (1998)"},{"key":"9058_CR13","unstructured":"Fitting, M.: Justification logics and conservative extensions. Technical Report TR-2007015, CUNY Ph.D. Program in Computer Science (2007)"},{"key":"9058_CR14","unstructured":"Fitting, M.: Reasoning with justifications. Stud. Log. (2007, to appear)"},{"key":"9058_CR15","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. Cambridge University Press, New York (1995)"},{"key":"9058_CR16","doi-asserted-by":"crossref","first-page":"494","DOI":"10.2307\/2269958","volume":"36","author":"R. Parikh","year":"1971","unstructured":"Parikh, R.: Existence and feasibility in arithmetic. J. Symb. Log. 36, 494\u2013508 (1971)","journal-title":"J. Symb. Log."},{"key":"9058_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02757006","volume":"25","author":"R.M. Solovay","year":"1976","unstructured":"Solovay, R.M.: Provability interpretations of modal logic. Isr. J. Math. 25, 287\u2013304 (1976)","journal-title":"Isr. J. Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9058-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9058-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9058-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:34Z","timestamp":1558684294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9058-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,13]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9058"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9058-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,13]]}}}