{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:11Z","timestamp":1762458851218},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_19","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"263-277","source":"Crossref","is-referenced-by-count":14,"title":["Generic Methods for Formalising Sequent Calculi Applied to Provability Logic"],"prefix":"10.1007","author":[{"given":"Jeremy E.","family":"Dawson","sequence":"first","affiliation":[]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1571-0661(04)80880-6","volume":"42","author":"Jeremy E. Dawson","year":"2001","unstructured":"Dawson, J.E., Gor\u00e9, R.: Embedding display calculi into logical frameworks: Comparing Twelf and Isabelle. ENTCS, vol.\u00a042, pp. 89\u2013103","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45685-6_10","volume-title":"Theorem Proving in Higher Order Logics","author":"J.E. Dawson","year":"2002","unstructured":"Dawson, J.E., Gor\u00e9, R.: Formalised Cut Admissibility for Display Logic. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 131\u2013147. Springer, Heidelberg (2002)"},{"key":"19_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-71070-7_13","volume-title":"Automated Reasoning","author":"A. Gacek","year":"2008","unstructured":"Gacek, A.: The Abella interactive theorem prover (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 154\u2013161. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Gor\u00e9, R.: Machine Checking Proof Theory: An Application of Logic to Logic. In: Invited talk, Third Indian Conference on Logic and Applications, Chennai (January 2009)","key":"19_CR4","DOI":"10.1007\/978-3-540-92701-3_2"},{"unstructured":"Gor\u00e9, R., Ramanayake, R.: Valentini\u2019s Cut-elimination for Provability Logic Resolved. In: Proc. AiML 2008, pp. 67\u201386. College Publications (2008), http:\/\/users.rsise.anu.edu.au\/~rpg\/publications.html","key":"19_CR5"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.2307\/2273755","volume":"46","author":"D. Leivant","year":"1981","unstructured":"Leivant, D.: On the Proof Theory of the Modal Logic for Arithmetic Provability. Journal of Symbolic Logic\u00a046, 531\u2013538 (1981)","journal-title":"Journal of Symbolic Logic"},{"unstructured":"Moen, A.: The proposed algorithms for eliminating cuts in the provability calculus GLS do not terminate. In: NWPT 2001, Norwegian Computing Center (2001-12-10), http:\/\/publ.nr.no\/3411","key":"19_CR7"},{"unstructured":"Pfenning, F.: Structural cut elimination. In: Proc. LICS 1994 (1994)","key":"19_CR8"},{"key":"19_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf a meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02757006","volume":"25","author":"R.M. Solovay","year":"1976","unstructured":"Solovay, R.M.: Provability Interpretations of Modal Logic. Israel Journal of Mathematics\u00a025, 287\u2013304 (1976)","journal-title":"Israel Journal of Mathematics"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BF00249262","volume":"12","author":"S. Valentini","year":"1983","unstructured":"Valentini, S.: The Modal Logic of Provability: Cut-elimination. Journal of Philosophical Logic\u00a012, 471\u2013476 (1983)","journal-title":"Journal of Philosophical Logic"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T06:02:18Z","timestamp":1559714538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}